Lexicographic Product of Extendable Graphs

• Published in: Bulletin of the Malaysian Mathematical Sciences Society Vol. 33; no. 2
• Main Authors: Bai, Bing, Wu, Zefang, Yang, Xu, Yu, Qinglin
• Format: Journal Article
• Language: English
• Published: Heidelberg Springer Nature B.V 01.01.2010
• Subjects: Mathematics

Lexicographic product G ο H of two graphs G and H has vertex set V(G) × V(H) and two vertices (u1, v1) and (u2, v2) are adjacent whenever u1u2 [empty set] E(G), or u1 = u2 and v1u2 [empty set] E(H). If every matching of G of size k can be extended to a perfect matching in G, then G is called k-exten...