Minimum Number of Components of 2-Factors in Iterated Line Graphs

Shengmei Lv; Liming Xiong

doi:10.1007/s40840-015-0145-x

Minimum Number of Components of 2-Factors in Iterated Line Graphs

Shengmei Lv, Liming Xiong^*

^*Corresponding author for this work

School of Mathematics and Statistics

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

Abstract

It is well known that it is NP-hard to determine the minimum number of components of a 2-factor in a graph, even for iterated line graphs. In this paper, we determine the minimum number of components of 2-factors in iterated line graphs of some special tree-like graphs. It extends some known results.

Original language	English
Pages (from-to)	361-371
Number of pages	11
Journal	Bulletin of the Malaysian Mathematical Sciences Society
Volume	39
DOIs	https://doi.org/10.1007/s40840-015-0145-x
Publication status	Published - 1 Jun 2016

Keywords

2-Factor
Cut-branch
Hamiltonian index
Iterated line graph

Access to Document

10.1007/s40840-015-0145-x

Cite this

@article{e42ed1b517244776bbf09c1fc9f9f03b,

title = "Minimum Number of Components of 2-Factors in Iterated Line Graphs",

abstract = "It is well known that it is NP-hard to determine the minimum number of components of a 2-factor in a graph, even for iterated line graphs. In this paper, we determine the minimum number of components of 2-factors in iterated line graphs of some special tree-like graphs. It extends some known results.",

keywords = "2-Factor, Cut-branch, Hamiltonian index, Iterated line graph",

author = "Shengmei Lv and Liming Xiong",

note = "Publisher Copyright: {\textcopyright} 2015, Malaysian Mathematical Sciences Society and Universiti Sains Malaysia.",

year = "2016",

month = jun,

day = "1",

doi = "10.1007/s40840-015-0145-x",

language = "English",

volume = "39",

pages = "361--371",

journal = "Bulletin of the Malaysian Mathematical Sciences Society",

issn = "0126-6705",

publisher = "Springer Singapore",

}

TY - JOUR

T1 - Minimum Number of Components of 2-Factors in Iterated Line Graphs

AU - Lv, Shengmei

AU - Xiong, Liming

PY - 2016/6/1

Y1 - 2016/6/1

N2 - It is well known that it is NP-hard to determine the minimum number of components of a 2-factor in a graph, even for iterated line graphs. In this paper, we determine the minimum number of components of 2-factors in iterated line graphs of some special tree-like graphs. It extends some known results.

AB - It is well known that it is NP-hard to determine the minimum number of components of a 2-factor in a graph, even for iterated line graphs. In this paper, we determine the minimum number of components of 2-factors in iterated line graphs of some special tree-like graphs. It extends some known results.

KW - 2-Factor

KW - Cut-branch

KW - Hamiltonian index

KW - Iterated line graph

UR - https://www.scopus.com/pages/publications/84976274347

U2 - 10.1007/s40840-015-0145-x

DO - 10.1007/s40840-015-0145-x

M3 - Article

AN - SCOPUS:84976274347

SN - 0126-6705

VL - 39

SP - 361

EP - 371

JO - Bulletin of the Malaysian Mathematical Sciences Society

JF - Bulletin of the Malaysian Mathematical Sciences Society

ER -

Minimum Number of Components of 2-Factors in Iterated Line Graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this