Papers
Topics
Authors
Recent
Search
2000 character limit reached

Alternative Proofs on the Indices of Cacti and Unicyclic Graphs with nn Vertices

Published 12 Oct 2011 in math.CO | (1110.2571v3)

Abstract: Let HnH_n be the cactus obtained from the star K1,n−1K_{1,n-1} by adding ⌊n−12⌋\lfloor \frac{n-1}{2}\rfloor independent edges between pairs of pendant vertices. Let K1,n−1<sup>+K_{1,n-1}<sup>+ be the unicyclic graph obtained from the star K1,n−1K_{1,n-1} by appending one edge. In this paper we give alternative proofs of the following results: Among all cacti with nn vertices, HnH_n is the unique cactus whose spectral radius is maximal, and among all unicyclic graphs with nn vertices, K1,n−1<sup>+K_{1,n-1}<sup>+ is the unique unicyclic graph whose spectral radius is maximal. We also prove that among all odd-cycle graphs with nn vertices, HnH_n is the unique odd-cycle graph whose spectral radius is maximal.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.