THE number of disjoint perfect matchings in semi-regular graphs

Hongliang Lu; David G.L. Wang

doi:10.2298/AADM161109030L

THE number of disjoint perfect matchings in semi-regular graphs

Hongliang Lu, David G.L. Wang^*

^*Corresponding author for this work

School of Mathematics and Statistics

Xi'an Jiaotong University

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

We obtain a sharp result that for any even n ≥ 34, every (D_n; D_n+1)-regular graph of order n contains (n/4- disjoint perfect matchings, where D_n = 2(n/4)-1. As a consequence, for any integer D ≥ D_n, every (D; D + 1)- regular graph of order n contains (D-(n/4)+1) disjoint perfect matchings.

Original language	English
Pages (from-to)	11-38
Number of pages	28
Journal	Applicable Analysis and Discrete Mathematics
Volume	11
Issue number	1
DOIs	https://doi.org/10.2298/AADM161109030L
Publication status	Published - 1 Apr 2017

Keywords

Factorization
Hamiltonian Graph
Perfect Matching
Regular Graph
Semiregular Graph

Access to Document

10.2298/AADM161109030L

Cite this

@article{bc2572f9a4084affaccd0870738e5c6d,

title = "THE number of disjoint perfect matchings in semi-regular graphs",

abstract = "We obtain a sharp result that for any even n ≥ 34, every (Dn; Dn+1)-regular graph of order n contains (n/4- disjoint perfect matchings, where Dn = 2(n/4)-1. As a consequence, for any integer D ≥ Dn, every (D; D + 1)- regular graph of order n contains (D-(n/4)+1) disjoint perfect matchings.",

keywords = "Factorization, Hamiltonian Graph, Perfect Matching, Regular Graph, Semiregular Graph",

author = "Hongliang Lu and Wang, {David G.L.}",

year = "2017",

month = apr,

day = "1",

doi = "10.2298/AADM161109030L",

language = "English",

volume = "11",

pages = "11--38",

journal = "Applicable Analysis and Discrete Mathematics",

issn = "1452-8630",

publisher = "University of Belgrade",

number = "1",

}

TY - JOUR

T1 - THE number of disjoint perfect matchings in semi-regular graphs

AU - Lu, Hongliang

AU - Wang, David G.L.

PY - 2017/4/1

Y1 - 2017/4/1

N2 - We obtain a sharp result that for any even n ≥ 34, every (Dn; Dn+1)-regular graph of order n contains (n/4- disjoint perfect matchings, where Dn = 2(n/4)-1. As a consequence, for any integer D ≥ Dn, every (D; D + 1)- regular graph of order n contains (D-(n/4)+1) disjoint perfect matchings.

AB - We obtain a sharp result that for any even n ≥ 34, every (Dn; Dn+1)-regular graph of order n contains (n/4- disjoint perfect matchings, where Dn = 2(n/4)-1. As a consequence, for any integer D ≥ Dn, every (D; D + 1)- regular graph of order n contains (D-(n/4)+1) disjoint perfect matchings.

KW - Factorization

KW - Hamiltonian Graph

KW - Perfect Matching

KW - Regular Graph

KW - Semiregular Graph

UR - http://www.scopus.com/inward/record.url?scp=85018450162&partnerID=8YFLogxK

U2 - 10.2298/AADM161109030L

DO - 10.2298/AADM161109030L

M3 - Article

AN - SCOPUS:85018450162

SN - 1452-8630

VL - 11

SP - 11

EP - 38

JO - Applicable Analysis and Discrete Mathematics

JF - Applicable Analysis and Discrete Mathematics

IS - 1

ER -

THE number of disjoint perfect matchings in semi-regular graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this