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

研究成果: Article › 査読

1 被引用数 (Scopus)

抄録

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.

本文言語	English
論文番号	112260
ジャーナル	Discrete Mathematics
巻	344
号	4
DOI	https://doi.org/10.1016/j.disc.2020.112260
出版ステータス	Published - 2021 4月

ASJC Scopus subject areas

理論的コンピュータサイエンス
離散数学と組合せ数学

文献へのアクセス

10.1016/j.disc.2020.112260

他のファイルとリンク

Scopusの出版物のリンク

引用スタイル

@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 = "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

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

抄録

ASJC Scopus subject areas

文献へのアクセス

他のファイルとリンク

フィンガープリント

引用スタイル