摘要
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, M1∪M2∪…∪Mk covers V（G）. This paper shows if G is a nontrivial tree, then imc（G） E {△0^＊CG）, △0^＊（G） ＋ 1, △0^＊（G） ＋ 2}, where △0^＊（G） = max{d0（u） ＋ d0（v）： u,v ∈ V（G）,uv ∈ E（G）}.
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, M1∪M2∪…∪Mk covers V（G）. This paper shows if G is a nontrivial tree, then imc（G） E {△0^＊CG）, △0^＊（G） ＋ 1, △0^＊（G） ＋ 2}, where △0^＊（G） = max{d0（u） ＋ d0（v）： u,v ∈ V（G）,uv ∈ E（G）}.
基金
Supported by the National Natural Science Foundation of China (Grant No.10771179)
