Published January 1, 2017
| Version v1
Journal article
Open
ON MATCHING EXTENDABILITY OF LEXICOGRAPHIC PRODUCTS
- 1. Bogazici Univ, Dept Ind Engn, TR-34342 Istanbul, Turkey
- 2. Gebze Tech Univ, Comp Engn Dept, TR-41400 Gebze, Kocaeli, Turkey
Description
A graph G of even order is l-extendable if it is of order at least 2l + 2, contains a matching of size l, and if every such matching is contained in a perfect matching of G. In this paper, we study the extendability of lexicographic products of graphs. We characterize graphs G and H such that their lexicographic product is not 1-extendable. We also provide several conditions on the graphs G and H under which their lexicographic product is 2-extendable.
Files
bib-5548fa13-7dba-46dd-bb28-fdd1fb46f027.txt
Files
(166 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:660f1cc4043bdacdb445daeb962bba87
|
166 Bytes | Preview Download |