Independence number and spectral radius of cactus graphs
From MaRDI portal
Publication:6495260
DOI10.1016/J.DAM.2024.03.007MaRDI QIDQ6495260
Rui-fang Liu, Jie Xue, Pei Liu
Publication date: 30 April 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planar graphs have independence ratio at least 3/13
- The sharp lower bound for the spectral radius of connected graphs with the independence number
- Spectra of graphs
- On the spectral radius of trees with given independence number
- The minimum spectral radius of graphs with a given independence number
- Spectral bounds for the clique and independence numbers of graphs
- The spectral radius of trees on \(k\) pendant vertices
- A lower bound for the independence number of a planar graph
- Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
- The spectral radius of graphs with given independence number
- Unimodality of principal eigenvector and its applications
- 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\)
- On the spectral radius of cactuses with perfect matchings
- GRAPHS WITH SMALL INDEPENDENCE NUMBER MINIMIZING THE SPECTRAL RADIUS
- Orderingn-vertex cacti with matching numberqby their spectral radii
- On the spectral radius of cacti withk-pendant vertices
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- Spectral Radius of Graphs
- On the index of cactuses with n vertices
This page was built for publication: Independence number and spectral radius of cactus graphs
