Chinese Quarterly Journal of Mathematics ›› 2011, Vol. 26 ›› Issue (3): 355-359.

Previous Articles     Next Articles

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

  

  1. 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)；

PDF (PC)

327

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 {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}.

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

CLC Number: 

Copyright © Chinese Quarterly Journal of Mathematics, All Rights Reserved.
Tel: 0371-23881698　E-mail: sxjk@henu.edu.cn　QQ: 2454327236
Powered by Beijing Magtech Co., Ltd.