当前位置:
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
中文翻译:
图的范型条件为 -叶连接
更新日期:2020-12-29
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 , a graph is said to be -leaf connected if and for each subset of with , has a spanning tree with precisely as the set of endvertices of . This property is a general concept of Hamiltonian-connected. This paper gives a Fan-type condition for graphs to be -leaf-connected.
中文翻译:
图的范型条件为 -叶连接
对于 图 据说是 -叶连接,如果 对于每个子集 的 与 , 有一棵生成树 精确地 作为的一组端点 。此属性是哈密顿连通的一般概念。本文给出了图的范型条件-叶连接。