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 pres...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.展开更多
基金the National Natural Science Foundation of China(Nos.11971311,12161141003,and 12026230)Science and Technology Commission of Shanghai Municipality(No.22JC1403600)+1 种基金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.
