Super-Edge-Connectivity and Zeroth-Order Randi´c Index  

作　　者：Zhi-Hong He Mei Lu 

机构地区：[1]School of Mathematics and Information Science,Yantai University,Yantai 264005,Shandong,China [2]Department of Mathematical Science,Tsinghua University,Beijing 100084,China

出　　处：《Journal of the Operations Research Society of China》2019年第4期615-628,共14页中国运筹学会会刊（英文）

基　　金：This work is supported by the National Natural Science Foundation of China(Nos.11501490,61373019,13071107);the Natural Science Foundation of Shandong Province(No.ZR2015AM006).

摘　　要：Define the zeroth-order Randic index R^(0)(G)=∑x∈V(G)1/√dG1(x),where dG(x)denotes the degree of the vertex x.In this paper,we present two sufficient conditions for graphs and triangle-free graphs to be super-edge-connected in terms of the zeroth-order Randic index,respectively.

关 键 词：Zeroth-order Randic index Super-edge-connected DEGREE Triangle-free graph Minimum degree 

分 类 号：O15[理学—数学]