Abstract
In this paper, it is shown that among connected graphs with maximum clique size ω, the minimum value of the spectral radius of adjacency matrix is attained for a kite graph PKn-ω,ω, consists of a complete graph Kω to a vertex of which a path Pn-ω is attached. For any fixed ω, a small interval to which the spectral radii of kites PKm,ω, m≥1, belong is exhibited.
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.
