- Research Article
- Open Access
- Published:

# Ordering Unicyclic Graphs in Terms of Their Smaller Least Eigenvalues

*Journal of Inequalities and Applications*
**volume 2010**, Article number: 591758 (2010)

## Abstract

Let be a simple graph with vertices, and let be the least eigenvalue of . The connected graphs in which the number of edges equals the number of vertices are called unicyclic graphs. In this paper, the first five unicyclic graphs on order in terms of their smaller least eigenvalues are determined.

## 1. Introduction

Let be a simple graph with vertices, and let be the -adjacency matrix of . We call the characteristic polynomial of , denoted by , or abbreviated . Since is symmetric, its eigenvalues are real, and we assume that . We call the least eigenvalue of . Up to now, some good results on the least eigenvalues of simple graphs have been obtained.

(1)In [1], let be a simple graph with vertices, , then

The equality holds if and only if , where is the graph obtained from by joining a vertex of with .

(2)In [2–4], let be a simple graph with vertices, then

The equality holds if and only if .

(3)In [5], let be a planar graph with vertices, then

The equality holds if and only if .

(4)In [6], the author surveyed the main results of the theory of graphs with least eigenvalue −2 starting from late 1950s.

Connected graphs in which the number of edges equals the number of vertices are called unicyclic graphs. Also, the least eigenvalues of unicyclic graphs have been studied in the past years. We now give some related works on it.

(1)In [7], let denote the set of unicyclic graphs on order . The authors characterized the unique graph with minimum least eigenvalue (also in [8, 9]) (resp., the unique graph with maximum spread) among all graphs in .

(2)In [10], let be a unicyclic graph with vertices, and let be the graph obtained by joining each vertex of to a pendant vertex of , respectively, where , , and . Then

The equality holds if and only if .

In this paper, the first five unicyclic graphs on order in terms of their smaller least eigenvalues are determined. The terminologies not defined here can be found in [11, 12].

## 2. Some Known Results on the Spectral Radii of Graphs

In this section, we will give some known results on the spectral radius of a forestry or an unicyclic graph. They will be useful in the proofs of the following results.

Firstly, we write denotes the tree of order obtained from the star by joining a pendant vertex of with .

Lemma 2.1 (see [13]).

Let be a forestry with vertices. , , . Then

Now, we consider unicyclic graphs. For convenience, we write

Also, we write denotes the unicyclic graph obtained from by joining a vertex of with , and denotes the unicyclic graph obtained from by joining two adjacent vertices of with and , respectively. Then we have the following.

Lemma 2.2 (see [14]).

, .

Lemma 2.3 (see [15]).

Let , , then

Lemma 2.4 (see [15]).

For , one has

## 3. The Least Eigenvalues of Unicyclic Graphs

Firstly, we give the following definitions of the order " (or )" between two graphs or two sets of graphs.

Definition 3.1.

Let be two simple graphs on order , and let , be two sets of simple graphs on order .

(1)We say that " is *majorized* (or strictly majorized) by ," denoted by (or ) if (or ).

(2)We say that " is *majorized* (or strictly majorized) by ", denoted by (or ) if (or ) for each and .

The following lemmas will be useful in the proofs of the main results.

Lemma 3.2 (see [16]).

Let be a simple graph with vertex set and , then

where the first summation goes through all vertices adjacent to , and the second summation goes through all circuits belonging to , denotes the set of all circuits containing the vertex .

Lemma 3.3 (see [12]).

Let be a subset of vertices of a graph and , then

Lemma 3.4 (see [2]).

Let be a bipartite graph with vertices, then

Lemma 3.5 (see [3]).

Let be a simple graph with vertices. Then there exist a spanning subgraph of such that is a bipartite graph and .

Now, we consider the least eigenvalues of unicyclic graphs. For the graphs in , we have the following results.

Lemma 3.6.

, .

Proof.

By Lemma 3.2, we have

and by Lemma 3.5, there exist a spanning subgraph of such that is a bipartite graph and . Obviously, is a forestry. So, by Lemma 2.1, we have . But . Thus, .

Also, by Lemma 3.2, we have

Then . From the table of connected graphs on six vertices in [17], we know that

So, by Lemma 3.3, we have

Thus, , where . Also, by Lemma 3.3, we have

So, . Hence the result holds.

Lemma 3.7.

For , one has

where denotes the graph obtained from by joining a pendant vertex of with .

Proof.

By Lemma 3.2, we have

And by Lemma 3.5, there exist a spanning subgraph of such that is a bipartite graph and . Obviously, is a forestry and for . So, by Lemma 3.6, we have . But . Thus

Also, by Lemma 3.2, we have

So

The least root of is . Let , then we have

Moreover, by Lemma 3.3, we know

So,

Thus,

Then, .

By Lemma 3.2, we have

and

So,

Thus, when , it is not difficult to know that

then .

Lemma 3.8.

Let , , , , then, for , one has

Proof.

Let , , . Then, by Lemma 3.5, there exist a spanning subgraph such that is a bipartite graph and . Obviously, is a forestry and for . So, by Lemma 2.1, we have

Thus

Now, we consider the graphs in , we have the following results.

Lemma 3.9.

, .

Proof.

By Lemma 3.2, we have

We can easily to know that

Moreover, . So,

And then,

Lemma 3.10.

For , one has

Proof.

By Lemma 3.2, we get

So,

Since

So,

It is not difficult to know that for . Thus,

Furthermore, by Lemma 3.3, we have

So for . It means that for .

Since is a spanning subgraph of . So for . It means that for .

Lemma 3.11.

Let , . Then .

Proof.

When , , , by Lemma 2.3, we have

Then, by Lemma 2.2, we have

When , by Lemmas 2.2 and 2.4, we have

So,

Thus the result holds.

Lemma 3.12.

for and for .

Proof.

By the proof of Lemma 3.6, we have

So

Let . It is not difficult to know that for and for . Furthermore, by Lemma 3.3, we have

So, by the sign of , we know that for and for . Thus the result holds.

Lemma 3.13.

for .

Proof.

By the proofs of Lemmas 3.7 and 3.10, we have

so

since

And by Lemma 3.3, we know that

Now, let

then

It is easy to know that for . Thus,

Hence for .

When , by immediate calculation, we know the result holds too. This completes the proof.

## 4. Main Results

Now, we give the main result of this paper.

Theorem 4.1.

Let , , then

(1) for ;

(2) for .

Proof.

By the Lemmas 3.6–3.13, we know that the result holds.

## References

Hong Y: On the least eigenvalue of a graph.

*Systems Science and Mathematical Sciences*1993, 6(3):269–272.Constantine G: Lower bounds on the spectra of symmetric matrices with nonnegative entries.

*Linear Algebra and Its Applications*1985, 65: 171–178. 10.1016/0024-3795(85)90095-3Hong Y: Bounds of eigenvalues of a graph.

*Acta Mathematicae Applicatae Sinica*1988, 4(2):165–168. 10.1007/BF02006065Powers DL: Graph partitioning by eigenvectors.

*Linear Algebra and Its Applications*1988, 101: 121–133.Hong Y, Shu J-L: Sharp lower bounds of the least eigenvalue of planar graphs.

*Linear Algebra and Its Applications*1999, 296(1–3):227–232.Cvetković DM: Graphs with least eigenvalue ; a historical survey and recent developments in maximal exceptional graphs.

*Linear Algebra and Its Applications*2002, 356: 189–210. 10.1016/S0024-3795(02)00377-4Fan Y-Z, Wang Y, Gao Y-B: Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread.

*Linear Algebra and Its Applications*2008, 429(2–3):577–588. 10.1016/j.laa.2008.03.012Wu Y-R, Shu J-L: The spread of the unicyclic graphs.

*European Journal of Combinatorics*2010, 31(1):411–418. 10.1016/j.ejc.2009.03.043Xu G-H, Xu Q-F, Wang S-K: A sharp lower bound on the least eigenvalue of unicyclic graphs.

*Journal of Ningbo University (NSEE)*2003, 16(3):225–227.Xu G-H: Upper bound on the least eigenvalue of unicyclic graphs.

*Journal of Zhejiang Forestry University*1998, (3):304–309.Bollobás B:

*Modern Graph Theory, Graduate Texts in Mathematics*.*Volume 184*. Springer, New York, NY, USA; 1998:xiv+394.Cvetković DM, Doob M, Sachs H:

*Spectra of Graphs, Pure and Applied Mathematics*.*Volume 87*. 2nd edition. Academic Press, New York, NY, USA; 1980:368.Hofmeister M: On the two largest eigenvalues of trees.

*Linear Algebra and Its Applications*1997, 260: 43–59.Hong Y: Bounds on the spectra of unicyclic graphs.

*Journal of East China Normal University*1986, (1):31–34.Guo SG: First six unicyclic graphs of order with larger spectral radius.

*Applied Mathematics A Journal of Chinese Universities*2003, 18(4):480–486.Schwenk AJ: Computing the characteristic polynomial of a graph. In

*Graphs and Combinatorics (Proc. Capital Conf., George Washington Univ., Washington, D.C., 1973), Lecture Notes in Math.*.*Volume 406*. Springer, Berlin, Germany; 1974:153–172.Cvetković DM, Petrić M: A table of connected graphs on six vertices.

*Discrete Mathematics*1984, 50(1):37–49.

## Acknowledgment

This work was supported by Zhejiang Provincial Natural Science Foundation of China (no. Y7080364).

## Author information

### Authors and Affiliations

### Corresponding author

## Rights and permissions

**Open Access** This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

## About this article

### Cite this article

Xu, GH. Ordering Unicyclic Graphs in Terms of Their Smaller Least Eigenvalues.
*J Inequal Appl* **2010**, 591758 (2010). https://doi.org/10.1155/2010/591758

Received:

Accepted:

Published:

DOI: https://doi.org/10.1155/2010/591758

### Keywords

- Bipartite Graph
- Planar Graph
- Connected Graph
- Spectral Radius
- Simple Graph