Alternative Proofs on the Indices of Cacti and Unicyclic Graphs with n Vertices
Abstract
Let Hn be the cactus obtained from the star K1,n-1 by adding n-12 independent edges between pairs of pendant vertices. Let K1,n-1+ be the unicyclic graph obtained from the star K1,n-1 by appending one edge. In this paper we give alternative proofs of the following results: Among all cacti with n vertices, Hn is the unique cactus whose spectral radius is maximal, and among all unicyclic graphs with n vertices, K1,n-1+ is the unique unicyclic graph whose spectral radius is maximal. We also prove that among all odd-cycle graphs with n vertices, Hn is the unique odd-cycle graph whose spectral radius is maximal.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.