3-正则无爪图的导出匹配覆盖

数学季刊 ›› 2011, Vol. 26 ›› Issue (3): 355-359.

3-正则无爪图的导出匹配覆盖

College of Mathematics and Information Science, Xinyang Normal University

收稿日期:2008-10-28 出版日期:2011-09-30 发布日期:2023-04-18
作者简介:DONG Li(1981-), female, native of Xinyang, Henan, a lecturer of Xinyang Normal University, M.S.D., engages in graph theory and combinatorial optimization.
基金资助:
Supported by the National Natural Science Foundation of China(10771179)；

Cover a 3-regular Claw-free Graph by Induced Matchings

College of Mathematics and Information Science, Xinyang Normal University

Received:2008-10-28 Online:2011-09-30 Published:2023-04-18
About author:DONG Li(1981-), female, native of Xinyang, Henan, a lecturer of Xinyang Normal University, M.S.D., engages in graph theory and combinatorial optimization.
Supported by:
Supported by the National Natural Science Foundation of China(10771179)；

摘要/Abstract

摘要： 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 {M₁,M₂,···,M_k} such that, V(M₁)∪V(M₂)∪···∪V(M_k) 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

Abstract: 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 {M₁,M₂,···,M_k} such that, V(M₁)∪V(M₂)∪···∪V(M_k) covers V(G). This paper shows that, if G is a 3-regular claw-free graph, then imc(G)∈{2,3}.

Key words: induced matching, induced matching cover, 3-regular claw-free

中图分类号:

O157.5

董丽, 汤京永, 宋新宇. 3-正则无爪图的导出匹配覆盖[J]. 数学季刊, 2011, 26(3): 355-359.

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, 26(3): 355-359.