The Q-index and Connectivity of Graphs  

作　　者：Peng-Li Zhang Li-Hua Feng Wei-Jun Liu Xiao-Dong Zhang 

机构地区：[1]School of Mathematical Sciences,MOE-LSC,SHL-MAC,Shanghai Jiao Tong University,Shanghai 200240,China [2]School of Mathematics and Statistics,Central South University,Changsha 410083,Hunan,China

出　　处：《Journal of the Operations Research Society of China》2024年第2期505-519,共15页中国运筹学会会刊（英文）

基　　金：the National Natural Science Foundation of China(Nos.11971311,12161141003,and 12026230);Science and Technology Commission of Shanghai Municipality(No.22JC1403600);Li-Hua Feng and Wei-Jun Liu are partly supported by the National Natural Science Foundation of China(Nos.11871479,12071484);Hunan Provincial Natural Science Foundation(Nos.2020JJ4675,2018JJ2479).

摘　　要：A connected graph G is said to be k-connected if it has more than k vertices and remains connected whenever fewer than k vertices are deleted.In this paper,for a connected graph G with sufficiently large order,we present a tight sufficient condition for G with fixed minimum degree to be k-connected based on the Q-index.Our result can be viewed as a spectral counterpart of the corresponding Dirac-type condition.

关 键 词：Q-index Minimum degree k-connected 

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