Abstract
The independence number of a graph is defined as the maximum size of a set of pairwise non-adjacent vertices and the spectral radius is defined as the maximum eigenvalue of the adjacency matrix of the graph. Xu et al. in [The minimum spectral radius of graphs with a given independence number, Linear Algebra and its Applications431 (2009) 937–945] determined the connected graphs of order n with independence number [Formula: see text] which minimize the spectral radius. In this paper, we show that the graph obtained from a path of order α by blowing up each vertex to a clique of order k minimizes the spectral radius among all connected graphs of order kα with independence number α for α = 3, 4 and conjecture that this is true for all α ∈ ℕ.
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.
