On Sufficient Conditions for k-Leaf-Connected Graphs  

作　　者：Guoyan Ao Xia HONG 

机构地区：[1]School of Mathematics and Physics,Hulunbuir University,Inner Mongolia 021008,P.R.China [2]Department of Mathematics,Luoyang Normal University,Henan 471022,P.R.China [3]Center for Information and Computing Science,Hulunbuir University,Inner Mongolia 021008,P.R.China

出　　处：《Journal of Mathematical Research with Applications》2024年第6期711-722,共12页数学研究及应用（英文版）

基　　金：Supported by the National Natural Science Foundation of China(Grant No.12261032);the Natural Science Foundation of Inner Mongolia Autonomous Region(Grant Nos.2024QN01020,2024JQ15);the Research Program of Science and Technology at Universities of Inner Mongolia Autonomous Region(Grant Nos.NJZY22280,NJZZ21052,NJZY23050);the Young Backbone Teachers in Henan Province(Grant No.2023GGJS126);the Young Backbone Teachers in Luoyang Normal University(Grant No.2021XJGGJS-07);the Key Project in Universities of Henan Province(Grant No.24B110009)。

摘　　要：For any integer k≥2,a graph G is called k-leaf-connected if|V(G)|≥k+1 and given any subset S■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-connected Zagreb index Hyper-Zagreb index 

分 类 号：O157.5[理学—数学]