Degree-Based Indices Sufficient Conditions for k-Leaf-Connected Graphs
The problem of determining whether a given graph is k-leaf-connected is NP-complete.Therefore,the study of sufficient conditions for k-leaf-connected graphs has far-reaching theoretical significance.In this paper,using the degree sequence condition of Gurgel et al.,we present sufficient conditions in terms of degree-based indices for a connected graph to be k-leaf-connected,which extend the corresponding results on Hamilton-connected graphs.
Hamilton-connectedk-leaf-connecteddegree-based index
NETL
NSTL
万方数据
