Corpus ID: 237532393

The Q-index and connectivity of graphs

@inproceedings{Zhang2021TheQA,
  title={The Q-index and connectivity of graphs},
  author={Pengli Zhang and Lihua Feng and Weijun Liu and Xiao-Dong Zhang},
  year={2021}
}
  • Pengli Zhang, Lihua Feng, +1 author Xiao-Dong Zhang
  • Published 16 September 2021
  • Mathematics
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. 
1 Citations
A survey on spectral conditions for some extremal graph problems
This survey is two-fold. We first report new progress on the spectral extremal results on the Turán type problems in graph theory. More precisely, we shall summarize the spectral Turán function inExpand

References

SHOWING 1-10 OF 38 REFERENCES
Spectral radius and k-connectedness of a graph
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, we present a tight sufficient conditionExpand
Some sufficient conditions on k-connected graphs
TLDR
This paper presents some further sufficient conditions for a graph to be k-connected in terms of signless Laplacian spectral radius, distance spectral radius of G and Wiener index, Harary index of its complement. Expand
Spectral Conditions for Graphs to be k-Hamiltonian or k-Path-Coverable
TLDR
By making use of the vertex degree sequence and an appropriate closure concept, sufficient spectral conditions of a connected graph with fixed minimum degree and large order to be k-Hamiltonian or k-path-coverable are presented. Expand
The spectral radius of graphs without paths and cycles of specified length
Abstract Let G be a graph with n vertices and μ ( G ) be the largest eigenvalue of the adjacency matrix of G . We study how large μ ( G ) can be when G does not contain cycles and paths of specifiedExpand
On a Conjecture about Tricyclic Graphs with Maximal Energy
For a given simple graph G, the energy of G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix, which was defined by I. Gutman. The problem onExpand
On the spectral radius of graphs with cut edges
We study the spectral radius of graphs with n vertices and k cut edges. In this paper, we show that of all the connected graphs with n vertices and k cut edges, the maximal spectral radius isExpand
Spectral radius and Hamiltonian properties of graphs
Let be a graph with minimum degree . The spectral radius of , denoted by , is the largest eigenvalue of the adjacency matrix of . In this note, we mainly prove the following two results.(1) Let be aExpand
The spectral radius of edge chromatic critical graphs
Abstract A connected graph G with maximum degree Δ and edge chromatic number χ ′ ( G ) = Δ + 1 is called Δ-critical if χ ′ ( G − e ) = Δ for every edge e of G. In this paper, we consider two weakerExpand
Spectral radius and Hamiltonicity of graphs with large minimum degree
AbstractLet G be a graph of order n and λ(G) the spectral radius of its adjacency matrix. We extend some recent results on sufficient conditions for Hamiltonian paths and cycles in G. One of the mainExpand
Spectral conditions for graphs to be β-deficient involving minimum degree
ABSTRACT The deficiency of a graph G is the number of vertices unmatched under a maximum matching in G. In this paper, we present sufficient spectral conditions of a (connected) graph to beExpand
...
1
2
3
4
...