Abstract
Let G(n,α) be the class of block graphs on n vertices and prescribed independence number α. In this article we prove that the maximum spectral radius ρ(G), among all graphs G∈G(n,α), is reached at a unique graph. As a byproduct we obtain an upper for ρ(G), when G∈G(n,α).
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
