首页|On Sufficient Conditions for k-Leaf-Connected Graphs
On Sufficient Conditions for k-Leaf-Connected Graphs
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
万方数据
For any integer k ≥ 2,a graph G is called k-leaf-connected if|V(G)|≥ k+1 and given any subset S C V(G)with|S|=k,G always has a spanning tree T such that S is precisely the set of leaves of T.In this paper,we prove best possible sufficient conditions for a graph to be k-leaf-connected in terms of the first Zagreb index,second Zagreb index and hyper-Zagreb index of G or its complement.
k-leaf-connectedZagreb indexHyper-Zagreb index
Guoyan AO、Xia HONG
展开 >
School of Mathematics and Physics,Hulunbuir University,Inner Mongolia 021008,P.R.China
Center for Information and Computing Science,Hulunbuir University,Inner Mongolia 021008,P.R.China
Department of Mathematics,Luoyang Normal University,Henan 471022,P.R.China
NETL
NSTL
万方数据
