On the spectral radius of block graphs having all their blocks of the same size

From MaRDI portal
Publication:2052182




Abstract: Let mathcalB(n,q) be the class of block graphs on n vertices having all their blocks of the same size. We prove that if GinmathcalB(n,q) has at most three pairwise adjacent cut vertices then the minimum spectral radius ho(G) is attained at a unique graph. In addition, we present a lower bound for ho(G) when GinmathcalB(n,q).









This page was built for publication: On the spectral radius of block graphs having all their blocks of the same size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052182)