Peng-Li Zhang, Lihua Feng, Weijun Liu, Xiao-Dong Zhang
Published 2021-09-16Version 1
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.
Comments: 11 pages. arXiv admin note: text overlap with arXiv:2109.07347
Maximizing $H$-colorings of connected graphs with fixed minimum degree
On (strong) proper vertex-connection of graphs
Connected even factors in the square of essentially 2-edge connected graphs
![QR code for arXiv:2109.07656 [math.CO]](http://oss.arxitics.com/images/favicon.svg)