Abstract
Let Ck△ be the graph obtained from a cycle Ck by adding a new vertex connecting two adjacent vertices in Ck. In this note, we obtain the graph maximizing the spectral radius among all graphs with size m and containing no subgraph isomorphic to C6△. As a byproduct, we will show that if the spectral radius λ(G)≥1+m−2, then G must contain all the cycles Ci for 3≤i≤7 unless G≅K3∇(m−33K1).
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.
