当前位置: X-MOL 学术Discret. Math. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Fan-type condition for graphs to be k-leaf-connected
Discrete Mathematics ( IF 0.7 ) Pub Date : 2020-12-29 , DOI: 10.1016/j.disc.2020.112260
Shun-ichi Maezawa , Ryota Matsubara , Haruhide Matsuda

For k2, 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.



中文翻译:

图的范型条件为 ķ-叶连接

对于 ķ2G 据说是 ķ-叶连接,如果 |G|>ķ 对于每个子集 小号VG|小号|=ķG 有一棵生成树 Ť 精确地 小号 作为的一组端点 Ť。此属性是哈密顿连通的一般概念。本文给出了图的范型条件ķ-叶连接。

更新日期:2020-12-29
down
wechat
bug