2000 character limit reached
Alternative Proofs on the Indices of Cacti and Unicyclic Graphs with Vertices
Published 12 Oct 2011 in math.CO | (1110.2571v3)
Abstract: Let be the cactus obtained from the star by adding independent edges between pairs of pendant vertices. Let be the unicyclic graph obtained from the star by appending one edge. In this paper we give alternative proofs of the following results: Among all cacti with vertices, is the unique cactus whose spectral radius is maximal, and among all unicyclic graphs with vertices, is the unique unicyclic graph whose spectral radius is maximal. We also prove that among all odd-cycle graphs with vertices, is the unique odd-cycle graph whose spectral radius is maximal.
Paper Prompts
Sign up for free to create and run prompts on this paper.