|
|||||
|
|
Maximal IM-unextendable graphs |
|
| Authors: | Qin Wang Jinjiang Yuan |
| Institution: | Department of Mathematics, Zhengzhou University, Zhengzhou 450052, People's Republic of China |
| Abstract: | A graph G is maximal IM-unextendable if G is not induced matching extendable and, for every two nonadjacent vertices x and y, G+xy is induced matching extendable. We show in this paper that a graph G is maximal IM-unextendable if and only if G is isomorphic to Mr (Ks(Kn1 Kn2 Knt)), where Mr is an induced matching of size r, r 1, t=s+2, and each ni is odd. |
| Keywords: | Perfect matching Induced matching IM-unextendable |
| 本文献已被 ScienceDirect 等数据库收录！ | |