On the spectral radius of bi-block graphs with given independence number $α$
Preprint
Abstract
A connected graph is called a bi-block graph if each of its blocks is a complete bipartite graph. Let $\mathcal{B}(\mathbf{k}, \alpha)$ be the class of bi-block graph on $\mathbf{k}$ vertices with given independence number $\alpha$. It is easy to see that every bi-block graph is a bipartite graph and for a bipartite graph $G$ on $\mathbf{k}$ vertices, the independence number $\alpha(G)$, satisfies $\ceil*{\frac{\mathbf{k}}{2}} \leq \alpha(G) \leq \mathbf{k}-1$. In this article, we prove that the maximum spectral radius $\rho(G)$ among all graphs $G$ in $\mathcal{B}(\mathbf{k}, \alpha)$, is uniquely attained for the complete bipartite graph $K_{\alpha, \mathbf{k}-\alpha}$.
Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- On the spectral radius of block graphs with prescribed independence number αLinear Algebra and its Applications, 2021
- On the spectral radius of trees with given independence numberLinear Algebra and its Applications, 2016
- Maximum spectral radius of graphs with given connectivity, minimum degree and independence numberJournal of Discrete Algorithms, 2015
- The minimum spectral radius of graphs with a given independence numberLinear Algebra and its Applications, 2009
- On the spectral radius of trees with fixed diameterLinear Algebra and its Applications, 2006
- The spectral radius of trees on k pendant verticesLinear Algebra and its Applications, 2005
- On the spectral radius of graphs with cut edgesLinear Algebra and its Applications, 2004