The \(Q\)-minimizer graph with given independence number
From MaRDI portal
Publication:6149172
DOI10.1016/J.LAA.2023.12.016OpenAlexW4390277773MaRDI QIDQ6149172
Wenjie Ning, Zhenzhen Lou, Yarong Hu
Publication date: 5 February 2024
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2023.12.016
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sharp bounds for the signless Laplacian spectral radius in terms of clique number
- The minimum signless Laplacian spectral radius of graphs with given independence number
- Signless Laplacians of finite graphs
- On the spectral radius of trees with given independence number
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- On graphs whose signless Laplacian index does not exceed 4.5
- Which graphs are determined by their spectrum?
- The spectral radius of graphs with given independence number
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
- A sharp upper bound on the signless Laplacian spectral radius of graphs
- The minimum spectral radius of signless Laplacian of graphs with a given clique number
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Maxima of the \(Q\)-index: graphs with no \(K_{1,t}\)-minor
- Towards a spectral theory of graphs based on the signless Laplacian, I
- On three conjectures involving the signless Laplacian spectral radius of graphs
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- Towards a spectral theory of graphs based on the signless Laplacian, III
- The Signless Laplacian Spectral Radius of Unicyclic Graphs with Graph Constraints
This page was built for publication: The \(Q\)-minimizer graph with given independence number
