2-factors with the bounded number of components in line graphs

Liming Xiong

doi:10.1016/j.aml.2010.12.018

2-factors with the bounded number of components in line graphs

Liming Xiong^*

^*Corresponding author for this work

School of Mathematics and Statistics

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

4 Citations (Scopus)

Abstract

Let G be a simple graph of order n such that every vertex of degree 1 is adjacent to a vertex of degree at least 3. In this work, we prove that the line graph L(G) has a 2-factor with at most n-1/3 components if every odd branch-bond of G has a shortest branch of length 2. This is a best possible result which can be thought of as a counterpart of the main result in Fujisawa et al. (2007) [8].

Original language	English
Pages (from-to)	731-734
Number of pages	4
Journal	Applied Mathematics Letters
Volume	24
Issue number	5
DOIs	https://doi.org/10.1016/j.aml.2010.12.018
Publication status	Published - May 2011

Keywords

2-factor
Branch-bond
Line graph
Number of components

Access to Document

10.1016/j.aml.2010.12.018

Cite this

@article{6f56cae6c7b04cf8a215d8c074120396,

title = "2-factors with the bounded number of components in line graphs",

abstract = "Let G be a simple graph of order n such that every vertex of degree 1 is adjacent to a vertex of degree at least 3. In this work, we prove that the line graph L(G) has a 2-factor with at most n-1/3 components if every odd branch-bond of G has a shortest branch of length 2. This is a best possible result which can be thought of as a counterpart of the main result in Fujisawa et al. (2007) [8].",

keywords = "2-factor, Branch-bond, Line graph, Number of components",

author = "Liming Xiong",

year = "2011",

month = may,

doi = "10.1016/j.aml.2010.12.018",

language = "English",

volume = "24",

pages = "731--734",

journal = "Applied Mathematics Letters",

issn = "0893-9659",

publisher = "Elsevier Ltd.",

number = "5",

}

TY - JOUR

T1 - 2-factors with the bounded number of components in line graphs

AU - Xiong, Liming

PY - 2011/5

Y1 - 2011/5

N2 - Let G be a simple graph of order n such that every vertex of degree 1 is adjacent to a vertex of degree at least 3. In this work, we prove that the line graph L(G) has a 2-factor with at most n-1/3 components if every odd branch-bond of G has a shortest branch of length 2. This is a best possible result which can be thought of as a counterpart of the main result in Fujisawa et al. (2007) [8].

AB - Let G be a simple graph of order n such that every vertex of degree 1 is adjacent to a vertex of degree at least 3. In this work, we prove that the line graph L(G) has a 2-factor with at most n-1/3 components if every odd branch-bond of G has a shortest branch of length 2. This is a best possible result which can be thought of as a counterpart of the main result in Fujisawa et al. (2007) [8].

KW - 2-factor

KW - Branch-bond

KW - Line graph

KW - Number of components

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

U2 - 10.1016/j.aml.2010.12.018

DO - 10.1016/j.aml.2010.12.018

M3 - Article

AN - SCOPUS:79551499587

SN - 0893-9659

VL - 24

SP - 731

EP - 734

JO - Applied Mathematics Letters

JF - Applied Mathematics Letters

IS - 5

ER -

2-factors with the bounded number of components in line graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this