Abstract
Let Bn,q be the set of all block graphs with n vertices and all blocks on q+1 vertices for every q≥2. In this paper, we determine the unique graph in Bn,q that attains the minimum spectral radius. This solves a conjecture posted by Conde et al. (2022) [4].
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
