On the spectral radius of block graphs having all their blocks of the same size (Q2052182): Difference between revisions

In this article, the authors consider the class of block graphs having all their blocks of the same size (\(\geq 3\)) and the bounds for the spectral radius established by \textit {L. Lovász} and \textit {J. Pelikan} [Period. Math. Hung. 3, 175--182 (1973; Zbl 0247.05108)]. In such class, the unique graph that reaches the minimum spectral radius in the case where the graph has at most three pairwise adjacent cut vertices is provided. Additional bounds are discussed.