On the minimum spectral radius of graphs with given order and dissociation number
From MaRDI portal
Publication:6657251
DOI10.1016/j.dam.2024.11.014MaRDI QIDQ6657251
Jing Zhao, Huiqing Liu, Jin Xiong
Publication date: 6 January 2025
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The sharp lower bound for the spectral radius of connected graphs with the independence number
- On the spectral radius of trees with given independence number
- On the spectral radius of quasi-tree graphs
- The minimum spectral radius of graphs with a given independence number
- The spectral radius of trees on \(k\) pendant vertices
- On the spectral radius of graphs with cut edges
- The spectral radius of graphs with given independence number
- On the spectral radius of block graphs with prescribed independence number \(\alpha\)
- On the spectral radius of bi-block graphs with given independence number \(\alpha\)
- Minimum \(k\)-path vertex cover
- GRAPHS WITH SMALL INDEPENDENCE NUMBER MINIMIZING THE SPECTRAL RADIUS
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- Node-Deletion Problems on Bipartite Graphs
- A bound on the dissociation number
- Relating the independence number and the dissociation number
- Maximization of the spectral radius of block graphs with a given dissociation number
- On spectral extrema of graphs with given order and dissociation number
- The minimal spectral radius with given independence number
- Spectra of graphs. Theory and application
This page was built for publication: On the minimum spectral radius of graphs with given order and dissociation number