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

Abstract 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.
AbstractList 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.
Author Yang, Xu
Bai, Bing
Wu, Zefang
Yu, Qinglin
Author_xml – sequence: 1
  givenname: Bing
  surname: Bai
  fullname: Bai, Bing
– sequence: 2
  givenname: Zefang
  surname: Wu
  fullname: Wu, Zefang
– sequence: 3
  givenname: Xu
  surname: Yang
  fullname: Yang, Xu
– sequence: 4
  givenname: Qinglin
  surname: Yu
  fullname: Yu, Qinglin
BookMark eNotjctqwzAUREVIIW6afzB0VxBcSda1siwhSQuGdpF90OMqD4LlWjbk8-PSzmYWc5jzzOZtamnGCikM8EoCzlkBQiLHGvSCrXK-whSNEqUo2FtD94tPp95254svv_sURj-UKZbb-0BtsO5G5f53zS_sKdpbptV_L9lhtz1sPnjztf_cvDe8E0YNPCqSrjYWIjmEWk1eEhZjQEHgyVt0GF1EgWCCDVopdEaspatgYtZqyV7_brs-_YyUh-M1jX07GY8CZK0rA1KrBwPtQIU
ContentType Journal Article
Copyright Copyright The Malaysian Mathematical Sciences Society 2010
Copyright_xml – notice: Copyright The Malaysian Mathematical Sciences Society 2010
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
BENPR
BGLVJ
BVBZV
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DatabaseName ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central
Technology collection
East & South Asia Database
ProQuest One Community College
ProQuest Central Korea
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
East & South Asia Database
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest One Academic
ProQuest Central (New)
Engineering Collection
ProQuest One Academic (New)
DatabaseTitleList Engineering Database
Database_xml – sequence: 1
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 2180-4206
ExternalDocumentID 2718135131
GroupedDBID 8FE
8FG
ABJCF
ABUWG
AFKRA
ALMA_UNASSIGNED_HOLDINGS
BENPR
BGLVJ
BPHCQ
BVBZV
CCPQU
DWQXO
HCIFZ
L6V
M7S
P2P
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
REM
TN5
ID FETCH-LOGICAL-p183t-f3e2b78a0feb6073670e1a6fd61e0ceca6b6fbf61608dad5336b8192b40fd693
IEDL.DBID BENPR
ISSN 0126-6705
IngestDate Sat Aug 16 22:20:47 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-p183t-f3e2b78a0feb6073670e1a6fd61e0ceca6b6fbf61608dad5336b8192b40fd693
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 1027548025
PQPubID 1006356
ParticipantIDs proquest_journals_1027548025
PublicationCentury 2000
PublicationDate 2010-01-01
PublicationDateYYYYMMDD 2010-01-01
PublicationDate_xml – month: 01
  year: 2010
  text: 2010-01-01
  day: 01
PublicationDecade 2010
PublicationPlace Heidelberg
PublicationPlace_xml – name: Heidelberg
PublicationTitle Bulletin of the Malaysian Mathematical Sciences Society
PublicationYear 2010
Publisher Springer Nature B.V
Publisher_xml – name: Springer Nature B.V
SSID ssj0000562621
ssj0000562622
Score 1.790093
Snippet 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]...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Mathematics
Title Lexicographic Product of Extendable Graphs
URI https://www.proquest.com/docview/1027548025
Volume 33
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV07a8MwED6aZGmH0id9pMFDp4LAcqSTMpWm5EFpQihpCF2CZUvQJY86hf78nhwlGQqdjDkPtqS77_yd9B3APcFOSxFsM2mlYIJyVmYkt4wyB1otUmAW-9PIgyH238XLVE4D4VaEbZXbmFgG6nyReY6cvDtRXpsskY_LFfNdo3x1NbTQqECNQrDWVai1O8PR245l8fCOAaD292VpgSfIUMXyTxAukaV7AschJYyeNnN4Cgd2fgZHg52eanEOD6_2h6asVJf-zKLRRqY1WrioU5LY_vxT1PPW4gLG3c74uc9ClwO2JHdaM9e0iVE6jZ01SA5H72R5ii5HbuPMZikadMYhx1jnaU7pGRqvYmZETM-0mpdQnS_m9goiJKMyiv5hhBQpV4Y3uUs1KvLZTLf4NdS3XzoLK7WY7cf15n_zLRxuKueefqhDdf31be8IkNemARXd7TXC2PvrpP0x-QXogoua
linkProvider ProQuest
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT8MwDLamcQAOiKd4DOgBLkiRmi5xugNCCPZiD3EY0m5V06YSl27QIeBH8R9x-tgOSNx2rFypSv3Fduz4M8AVuZ2WIrfNpJGCCYpZmZbcMIocCC1SYOTabuTRGHsv4mkqpzX4qXph7LXKyibmhjqeRTZHTrvbU5abzJN38zdmp0bZ6mo1QqOAxcB8f9KRLbvtP5J-rz2v05489Fg5VYDNCb4LljSNp5UfuonRSABH5RoeYhIjN25kohA1JjpBjq4fhzGFQ6gta5gWLr1juZfI4m-IJjly25je6S5TOjaWwNIbrp7zOgb3kNGH5B-Ln7uxzi7slPGnc18AZg9qJt2H7dGSvDU7gJuh-SJ85FTWr5HzXHDCOrPEaecZc9ts5XStNDuEyToWfwT1dJaaY3CQhEorOjAJKUKuNG_yJPRRkYGI_BY_gUa10qDcFlmwUuLp_-JL2OxNRsNg2B8PzmCrKNnbvEcD6ov3D3NOkcBCX-T_34Fgzfr-BV-DxRE
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Lexicographic+Product+of+Extendable+Graphs&rft.jtitle=Bulletin+of+the+Malaysian+Mathematical+Sciences+Society&rft.au=Bai%2C+Bing&rft.au=Wu%2C+Zefang&rft.au=Yang%2C+Xu&rft.au=Yu%2C+Qinglin&rft.date=2010-01-01&rft.pub=Springer+Nature+B.V&rft.issn=0126-6705&rft.eissn=2180-4206&rft.volume=33&rft.issue=2&rft.externalDocID=2718135131
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0126-6705&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0126-6705&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0126-6705&client=summon