A Fan-type condition for graphs to be k-leaf-connected
A Fan-type condition for graphs to be k-leaf-connected
复制标题
图 k 叶连通的扇形条件
DOI：
10.1016/j.disc.2020.112260
复制
发表时间：
2021
影响因子：
0.8
通讯作者：
Haruhide Matsuda
中科院分区：
文献类型：
--
作者：
Shun-ichi Maezawa;Ryota Matsubara;Haruhide Matsuda
当k≥ 2时，称图G是k-叶连通的，如果|G|> k且对于V（G）的每个子集S，|S| = k，G有一个生成树T，其中S恰好是T的端点集合。这个性质是Hamilton连通的一般概念。本文给出了图是k-叶连通的一个Fan型条件。
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.