On the spectral radius of bi-block graphs with given independence number \(\alpha\)

DOI10.1016/j.amc.2020.125912OpenAlexW3136470814MaRDI QIDQ2242751

Joyentanuj Das, Sumit Mohanty

Publication date: 10 November 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.04488

zbMATH Keywords

spectral radiusindependence numbercomplete bipartite graphsbi-block graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (5)

On spectral extrema of graphs with given order and dissociation number ⋮ The minimal spectral radius with given independence number ⋮ Laplacian eigenvalue distribution of a graph with given independence number ⋮ The spectral radius of graphs with given independence number ⋮ On a conjecture about the spectral radius of block graphs

Cites Work

• Unnamed Item
• On the spectral radius of trees with fixed diameter
• On the spectral radius of trees with given independence number
• 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
• Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
• Inverses of triangular matrices and bipartite graphs

This page was built for publication: On the spectral radius of bi-block graphs with given independence number \(\alpha\)