Lexicographic Product of Extendable Graphs

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

Full description

Saved in:
Bibliographic Details
Published inBulletin of the Malaysian Mathematical Sciences Society Vol. 33; no. 2
Main Authors Bai, Bing, Wu, Zefang, Yang, Xu, Yu, Qinglin
Format Journal Article
LanguageEnglish
Published Heidelberg Springer Nature B.V 01.01.2010
Subjects
Mathematics
Online AccessGet full text

Cover

More Information
Summary: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-extendable. In this paper, we study matching extendability in lexicographic product of graphs. The main result is that the lexicographic product of an m-extendable graph and an n-extendable graph is (m+1)(n+1)-extendable. In fact, we prove a slightly stronger result. 2000 Mathematics Subject Classification: 05C70, 05C76.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0126-6705
2180-4206