A Fan-type condition for graphs to be k-leaf-connected

Shun ichi Maezawa; Ryota Matsubara; Haruhide Matsuda

doi:10.1016/j.disc.2020.112260

A Fan-type condition for graphs to be k-leaf-connected

Shun ichi Maezawa, Ryota Matsubara, Haruhide Matsuda

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

Abstract

For k≥2, a graph G is said to be k-leaf connected if |G|>k and for each subset S of V(G) with |S|=k, G has a spanning tree T with precisely S as the set of endvertices of T. This property is a general concept of Hamiltonian-connected. This paper gives a Fan-type condition for graphs to be k-leaf-connected.

Original language	English
Article number	112260
Journal	Discrete Mathematics
Volume	344
Issue number	4
DOIs	https://doi.org/10.1016/j.disc.2020.112260
Publication status	Published - 2021 Apr

Keywords

Fan-type degree condition
Hamilton-connected
Spanning tree
k-leaf-connected

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2020.112260

Cite this

@article{02748e7aee534280887e851f2d1c13db,

title = "A Fan-type condition for graphs to be k-leaf-connected",

abstract = "For k≥2, a graph G is said to be k-leaf connected if |G|>k and for each subset S of V(G) with |S|=k, G has a spanning tree T with precisely S as the set of endvertices of T. This property is a general concept of Hamiltonian-connected. This paper gives a Fan-type condition for graphs to be k-leaf-connected.",

keywords = "Fan-type degree condition, Hamilton-connected, Spanning tree, k-leaf-connected",

author = "Maezawa, {Shun ichi} and Ryota Matsubara and Haruhide Matsuda",

note = "Funding Information: The authors would like to thank the referees for their valuable comments and suggestions. This work was supported by JSPS, Japan KAKENHI Grant Nos. JP20J15332 (to S. Maezawa) and JP20K03724 (to H. Matsuda and R. Matsubara). Publisher Copyright: {\textcopyright} 2020 Elsevier B.V.",

year = "2021",

month = apr,

doi = "10.1016/j.disc.2020.112260",

language = "English",

volume = "344",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - A Fan-type condition for graphs to be k-leaf-connected

AU - Maezawa, Shun ichi

AU - Matsubara, Ryota

AU - Matsuda, Haruhide

N1 - Funding Information: The authors would like to thank the referees for their valuable comments and suggestions. This work was supported by JSPS, Japan KAKENHI Grant Nos. JP20J15332 (to S. Maezawa) and JP20K03724 (to H. Matsuda and R. Matsubara). Publisher Copyright: © 2020 Elsevier B.V.

PY - 2021/4

Y1 - 2021/4

N2 - For k≥2, a graph G is said to be k-leaf connected if |G|>k and for each subset S of V(G) with |S|=k, G has a spanning tree T with precisely S as the set of endvertices of T. This property is a general concept of Hamiltonian-connected. This paper gives a Fan-type condition for graphs to be k-leaf-connected.

AB - For k≥2, a graph G is said to be k-leaf connected if |G|>k and for each subset S of V(G) with |S|=k, G has a spanning tree T with precisely S as the set of endvertices of T. This property is a general concept of Hamiltonian-connected. This paper gives a Fan-type condition for graphs to be k-leaf-connected.

KW - Fan-type degree condition

KW - Hamilton-connected

KW - Spanning tree

KW - k-leaf-connected

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

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

U2 - 10.1016/j.disc.2020.112260

DO - 10.1016/j.disc.2020.112260

M3 - Article

AN - SCOPUS:85098624375

SN - 0012-365X

VL - 344

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 4

M1 - 112260

ER -

A Fan-type condition for graphs to be k-leaf-connected

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this