Abstract
Let G be a graph of size m and ρ ( G ) be the spectral radius of its adjacency matrix. A graph is said to be H-free if it does not contain a subgraph isomorphic to H. Let C l 1 be the graph obtained by adding a pendent vertex to a cycle of length l. In this paper, we determine the graphs with the maximum spectral radius over C 3 1 -free graphs, and C 4 1 -free graphs with m ≥ 9 .
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 callMore From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: 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.
