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

preprint2011arXivOpen access

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+K_{1,n-1}^+ 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+K_{1,n-1}^+ 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.