| 3-正则无爪图的导出匹配覆盖(英文) |
| |
| 引用本文： | 董丽,汤京永,宋新宇. 3-正则无爪图的导出匹配覆盖(英文)[J]. 数学季刊, 2011, 0(3): 355-359 |
| |
| 作者姓名： | 董丽 汤京永 宋新宇 |
| |
| 作者单位： | College of Mathematics and Information Science;Xinyang Normal University; |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China(10771179) |
| |
| 摘 要： | The induced matching cover number of a graph G without isolated vertices, denoted by imc（G）,is the minimum integer k such that G has k induced matchings {M1,M2,···,Mk}such that,V（M1）∪V（M2）∪···∪V（Mk）covers V（G）.This paper shows that,if G is a 3-regular claw-free graph,then imc（G）∈{2,3}.
|
| 关 键 词： | induced matching induced matching cover 3-regular claw-free |
Cover a 3-regular Claw-free Graph by Induced Matchings |
| |
| DONG Li,TANG Jing-yong,SONG Xin-yu. Cover a 3-regular Claw-free Graph by Induced Matchings[J]. Chinese Quarterly Journal of Mathematics, 2011, 0(3): 355-359 |
| |
| Authors: | DONG Li TANG Jing-yong SONG Xin-yu |
| |
| Affiliation: | DONG Li,TANG Jing-yong,SONG Xin-yu (College of Mathematics and Information Science,Xinyang Normal University,Xinyang 464000,China) |
| |
| Abstract: | |
| |
| Keywords: | induced matching induced matching cover 3-regular claw-free |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
