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

Details Alternative Proofs on the Indices of Cacti and Unicyclic Graphs with $n$ Vertices Alternative Proofs on the Indices of Cacti and Unicyclic Graphs with $n$ Vertices

2011-10-12

arxiv.org/abs/1110.2571v3

Mathematics

Combinatorics

10 pages, 3 figures

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Alternative Proofs on the Indices of Cacti and Unicyclic Graphs with $n$ Vertices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Alternative Proofs on the Indices of Cacti and Unicyclic Graphs with $n$ Vertices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Alternative Proofs on the Indices of Cacti and Unicyclic Graphs with $n$ Vertices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-633009