# Bounds on normalized Laplacian eigenvalues of graphs

- Jianxi Li
^{1, 2}Email author, - Ji-Ming Guo
^{3}and - Wai Chee Shiu
^{4}

**2014**:316

https://doi.org/10.1186/1029-242X-2014-316

© Li et al.; licensee Springer. 2014

**Received: **6 January 2014

**Accepted: **22 July 2014

**Published: **21 August 2014

## Abstract

Let *G* be a simple connected graph of order *n*, where $n\ge 2$. Its normalized Laplacian eigenvalues are $0={\lambda}_{1}\le {\lambda}_{2}\le \cdots \le {\lambda}_{n}\le 2$. In this paper, some new upper and lower bounds on ${\lambda}_{n}$ are obtained, respectively. Moreover, connected graphs with ${\lambda}_{2}=1$ (or ${\lambda}_{n-1}=1$) are also characterized.

**MSC:**05C50, 15A48.

### Keywords

normalized Laplacian eigenvalue largest eigenvalue bound## 1 Introduction

Let *G* be a graph with vertex set $V(G)$ and edge set $E(G)$. Its *order* is $|V(G)|$, denoted by *n*, and its *size* is $|E(G)|$, denoted by *m*. In this paper, all graphs are simple connected of order $n\ge 2$. For $v\in V(G)$, let $d(v)$ and $N(v)$ be the degree and the set of neighbors of *v*, respectively. The maximum and minimum degrees of *G* are denoted by Δ and *δ*, respectively.

*G*, respectively. The

*Laplacian*and

*normalized Laplacian*matrices of

*G*are defined as $L(G)=D(G)-A(G)$ and $\mathcal{L}(G)=D{(G)}^{-1/2}L(G)D{(G)}^{-1/2}$, respectively. When only one graph

*G*is under consideration, we sometimes use

*A*,

*D*,

*L*and ℒ instead of $A(G)$, $D(G)$, $L(G)$ and $\mathcal{L}(G)$, respectively. It is easy to see that $\mathcal{L}(G)$ is a symmetric positive semidefinite matrix and $D{(G)}^{1/2}\mathbf{1}$ is an eigenvector of $\mathcal{L}(G)$ with eigenvalue 0, where

**1**is the vector with all ones. Thus, the eigenvalues ${\lambda}_{i}(G)$ ($1\le i\le n$) of $\mathcal{L}(G)$ (or the normalized Laplacian eigenvalues of

*G*) satisfy

Some of them may be repeated according to their multiplicities. We call ${\lambda}_{k}(G)$ the *k* th smallest normalized Laplacian eigenvalue of *G*. When only one graph *G* is under consideration, we sometimes write ${\lambda}_{k}$ instead of ${\lambda}_{k}(G)$, for $1\le k\le n$.

The normalized Laplacian is mentioned briefly in the recent monograph by Cvetković *et al.* [1]; however, the standard reference for it is the monograph by Chung [2], which deals almost entirely with this matrix. The normalized Laplacian eigenvalues can be used to give useful information about a graph [2]. For example, one can obtain the number of connected components from the multiplicity of the eigenvalue 0, the bipartiteness from its ${\lambda}_{n}$ (which is at most 2), as well as the connectivity from its ${\lambda}_{2}$. Moreover, ${\lambda}_{2}$ is also closely related to the discrete Cheeger’s constant, isoperimetric problems, *etc.* (see [2]). Chen and Jost [3] established the relationship between minimum vertex covers and the eigenvalues of the normalized Laplacian on trees. Some upper bounds for ${\lambda}_{n}$ have been introduced by Rojo and Soto [4] and Banerjee [5], respectively. For more results on the normalized Laplacian eigenvalues of graphs can be found in [2, 6, 7].

In this paper, some new upper and lower bounds on ${\lambda}_{n}$ of a graph in terms of its maximum degree, covering number *etc.*, are deduced, respectively. Moreover, connected graphs with ${\lambda}_{2}=1$ (or ${\lambda}_{n-1}=1$) are also characterized.

## 2 Preliminaries

Here we recall some basic properties of the eigenvalues and eigenfunctions of the normalized Laplacian matrix of a graph *G*.

*v*of

*G*a real value $g(v)$, the coordinate of

**g**according to

*v*. Let $\mathbf{f}={D}^{-1/2}\mathbf{g}$. Then we have

A vector **f** that satisfies equality in Eq. (2.1) is called a *harmonic eigenfunction* of ℒ associated with ${\lambda}_{n}(G)$.

**Proposition 2.1** ([2])

*Let*

*G*

*be a graph and*

**f**

*be a harmonic eigenfunction of*ℒ

*associated with*${\lambda}_{n}(G)$.

*Then for any*$v\in V(G)$,

*we have*

## 3 Main result

We call *G* a *triangulation*, if every pair of adjacent vertices of *G* have at least one common adjacent vertex. A planar graph is called a *maximal planar graph* if for every pair of nonadjacent vertices *u* and *v* of *G*, the graph $G+uv$ is nonplanar. Lu *et al.* [8] and Guo *et al.* [9] gave the upper bounds for the Laplacian spectral radius of a triangulation and a maximal planar graph, respectively. For the normalized Laplacian spectral radius, we have the following somewhat similar result.

**Theorem 3.1**

*Let*$G=(V,E)$

*be a triangulation of order*

*n*.

*Then*

*where* $m({v}_{i})={\sum}_{{v}_{j}\in N({v}_{i})}d({v}_{j})/d({v}_{i})$ *is the average* 2-*degree of the vertex* ${v}_{i}$. *Moreover*, *the equality holds if* $G\cong {K}_{3}$.

*Proof*Let $V=\{{v}_{1},\dots ,{v}_{n}\}$, and let $\mathbf{f}={(f({v}_{1}),\dots ,f({v}_{n}))}^{T}$ be the harmonic eigenfunction of $\mathcal{L}(G)$ corresponding to ${\lambda}_{n}$. Then by Proposition 2.1, we have for each ${v}_{i}\in V$,

where $m({v}_{i})={\sum}_{{v}_{j}\in N({v}_{i})}d({v}_{j})/d({v}_{i})$.

*G*is a triangulation. Then by Eq. (2.1), we have

For $G={K}_{3}$, it is easy to check that the equality holds. □

Furthermore, we have the following more general result.

**Theorem 3.2**

*Let*$G=(V,E)$

*be a simple connected graph of order*

*n*

*with*

*m*

*edges*.

*If each edge of*

*G*

*belongs to at least*

*t*

*triangles*($t\ge 1$),

*then*

*the equality occurs if* *G* *is the complete graph* ${K}_{t+2}$.

*Proof*For $G={K}_{t+2}$, it is easy to check that the equality in Eq. (3.3) holds. If we replace Eq. (3.2) in the proof of Theorem 3.1 by

then the result follows. □

For the maximal planar graphs, we have the following upper bound.

**Theorem 3.3**

*Let*

*G*

*be a maximal planar graph of order*$n\ge 4$

*with*

*m*

*edges*.

*Then*

*Proof* Note that for any maximal planar graph *G*, each edge of *G* belongs to at least 2 triangles. Then the result follows from Theorem 3.2. □

In what follows, we turn to some lower bounds on ${\lambda}_{n}$. The following result due to Chung [2] concerns the lower bound on ${\lambda}_{n}(G)$.

**Lemma 3.4** ([2])

*Let* *G* *be a connected graph of order* *n*. *Then* ${\lambda}_{n}(G)\ge \frac{n}{n-1}$, *the equality holds if and only if* $G\cong {K}_{n}$, *where* ${K}_{n}$ *is the complete graph of order* *n*.

*X*. The volume of

*X*is defined to be the sum of the degrees of the vertices in

*G*, that is,

Note that $vol(V)$ is equal to twice the number of edges in the graph.

**Theorem 3.5**

*Let*

*G*

*be a connected graph of order*

*n*

*with*

*m*

*edges*.

*For any nonempty subset*$X\subseteq V$,

*we have*

*where* ${E}_{X}$ *is the set of all edges with one end in* *X* *and the other end in* $\overline{X}$. *Moreover*, *if the equality holds*, *then* $\frac{{\sum}_{u\in N(v)}f(u)}{d(v)}=x$ *for each* $v\in X$ *and* $\frac{{\sum}_{u\in N(v)}f(u)}{d(v)}=y$ *for each* $v\in \overline{X}$, *where* *x* *and* *y* *are constant such that* $\frac{x}{y}=-\frac{vol(\overline{X})}{vol(X)}$.

*Proof*Let $X\subseteq V$ and

**f**be a vector such that

**f**is the harmonic eigenfunction of ℒ associated with ${\lambda}_{n}(G)$. Hence Proposition 2.1 implies that

Let $x=({\lambda}_{n}-1)vol(\overline{X})$ and $y=(1-{\lambda}_{n})vol(X)$. Then $\frac{x}{y}=-\frac{vol(\overline{X})}{vol(X)}$. This completes the proof. □

Let $X=\{u\}$ in Theorem 3.5. Note that $vol(X)=d(u)=|{E}_{X}|$. Then we have the following.

**Corollary 3.6**

*Let*

*G*

*be a graph of order*

*n*

*with*

*m*

*edges*.

*Then*

*where* Δ *is the maximum degree of* *G*.

**Remark 3.1** Note that $2m\le n\mathrm{\Delta}$ holds for any graph of order *n* with *m* edges and maximum degree Δ. Thus the lower bound in Corollary 3.6 is always better than that in Lemma 3.4. Moreover, if *G* is a complete graph ${K}_{n}$ or a star ${S}_{n}$, then it is easy to check that the equality holds in Eq. (3.5).

Similarly, let $X=\{u,v\}$ in Theorem 3.5. Then we have:

**Corollary 3.7**

*Let*

*G*

*be a graph of order*

*n*

*with*

*m*

*edges*.

*Let*$a={max}_{uv\in E(G)}\{d(u)+d(v)\}$

*and*$b={max}_{uv\notin E(G)}\{d(u)+d(v)\}$.

*Then*:

- (1)
${\lambda}_{n}\ge \frac{2m(a-2)}{a(2m-a)}$,

*and the equality holds if*$G\cong {K}_{n}$. - (2)
${\lambda}_{n}\ge \frac{2m}{2m-b}$,

*and the equality holds if*$G\cong {K}_{2,n-2}$,*where*$G\cong {K}_{2,n-2}$*is the complete bipartite graph with parts of cardinalities*2*and*$n-2$.

*Proof*Let $X=\{u,v\}$ in Theorem 3.5. If $uv\in E(G)$, then $|{E}_{X}|=d(u)+d(v)-2$ and $vol(X)=d(u)+d(v)$. Theorem 3.5 implies that

Let $f(x)=\frac{2m(x-2)}{x(2m-x)}$ for $x>2$. Then it is easy to see that $f(x)$ is increasing on *x*. Hence, we have ${\lambda}_{n}\ge \frac{2m(a-2)}{a(2m-a)}$. Moreover, it is easy to check that the equality holds when $G\cong {K}_{n}$.

Hence ${\lambda}_{n}\ge \frac{2m}{2m-b}$. Moreover, it is easy to check that the equality holds when $G\cong {K}_{2,n-2}$. □

A set of vertices *X* of *G* is called a *cover* of *G* if every edge of *G* is incident to some vertex in *X*. The least cardinality of a cover of *G* is called the *covering number* of *G* and denoted by $\tau (G)$. It is clear that if a vertex set *X* is a vertex cover if and only if $\overline{X}$ is an independent set. The following lower bound for ${\lambda}_{n}$ in terms of $\tau (G)$ is obtained.

**Theorem 3.8**

*Let*

*G*

*be a graph order*

*n*

*with*

*m*

*edges*.

*Then*

*where* *δ* *is the minimum degree of* *G*. *Moreover*, *the equality holds if* $G\cong {C}_{n}$ *when* *n* *is even*, $G\cong {K}_{a,b}$ *or* $G\cong {K}_{n}$, *where* ${C}_{n}$ *is the cycle of order* *n* *and* ${K}_{a,b}$ *is the complete bipartite graph with parts of cardinalities* *a* *and* *b*.

*Proof* Let *X* be a minimal covering set of *G* with $|X|=\tau (G)$. Then $\overline{X}$ is an independent set. Hence $vol(\overline{X})=|{E}_{X}|$ and $vol(X)=2m-|{E}_{X}|$. Then Theorem 3.5 implies that ${\lambda}_{n}\ge \frac{2m}{2m-|{E}_{X}|}$. Moreover, by the definition of covering set, we have $|{E}_{X}|\ge \delta (n-\tau (G))$. Hence we have ${\lambda}_{n}\ge \frac{2m}{2m-\delta (n-\tau (G))}$. Moreover, if $G\cong {C}_{n}$ when *n* is even, then $\tau (G)=\frac{n}{2}$. Hence it is easy to check that the equality holds. Similarly, if $G\cong {K}_{a,b}$ or $G\cong {K}_{n}$, then the equality holds. This completes the proof. □

Chung [2] proved that for any graph *G* of order *n*, ${\lambda}_{2}\le \frac{n}{n-1}$ with equality holding if and only if $G\cong {K}_{n}$. Moreover, the following result is also introduced.

**Lemma 3.9** ([2])

*Let* *G* ($G\ne {K}_{n}$) *be a connected graph of order* *n*. *Then* ${\lambda}_{2}\le 1$.

In what follows, we characterize all connected graphs with ${\lambda}_{2}=1$. We will make use of the following lemma.

**Lemma 3.10** ([7])

*Let*

*G*

*be a connected graph of order*

*n*

*with maximum degree*Δ

*and minimum degree*

*δ*.

*Let*${\rho}_{1}\le {\rho}_{2}\le \cdots \le {\rho}_{n}$

*are the eigenvalues of*$A(G)$.

*Then for each*$1\le k\le n$,

**Theorem 3.11** *Let* *G* ($G\ne {K}_{n}$) *be a connected graph of order* *n*. *Then* ${\lambda}_{2}=1$ *if and only if* *G* *is a complete multipartite graph*.

*Proof* By Lemma 3.10, if ${\lambda}_{2}=1$, then ${\rho}_{n-1}=0$, where ${\rho}_{n-1}$ is the second largest eigenvalue of $A(G)$. Hence the result follows from the fact that for any simple connected graph *G* of order *n*, ${\rho}_{n-1}\le 0$ if and only if *G* is a complete multipartite graph [10]. On the other hand, when *G* ($G\ne {K}_{n}$) is a complete multipartite graph, ${\rho}_{n-1}(G)=0$ [10]. This together with Lemma 3.10 imply that ${\lambda}_{2}=1$. The proof is completed. □

Moreover, the following result on ${\lambda}_{n-1}$ is also obtained.

**Theorem 3.12** *Let* *G* *be a connected graph of order* *n*. *Then* ${\lambda}_{n-1}\ge 1$, *the equality holds if and only if* *G* *is a complete bipartite graph*.

*Proof* Note that for any connected graph of order *n*, ${\lambda}_{1}=0$ and ${\lambda}_{n}\le 2$. Since ${\sum}_{i=1}^{n}{\lambda}_{i}=n$, ${\sum}_{i=2}^{n-1}{\lambda}_{i}\ge n-2$ and hence ${\lambda}_{n-1}\ge 1$. Moreover, if ${\lambda}_{n-1}=1$, then ${\lambda}_{2}=\cdots ={\lambda}_{n-1}=1$ and ${\lambda}_{n}=2$ since ${\sum}_{i=2}^{n}{\lambda}_{i}=n$. This implies that *G* is bipartite [2]. Moreover, since ${\lambda}_{2}=1$, combining with Theorem 3.11 we find that *G* is complete bipartite graph. On the other hand, it is easy to check that if *G* is a complete bipartite graph, then ${\lambda}_{n-1}=1$. This completes the proof. □

## Declarations

### Acknowledgements

The authors would like to thank the anonymous referees for their constructive corrections and valuable comments on this paper, which have considerably improved the presentation of this paper. This work was supported by NSF of China (Nos. 11101358, 61379021, 11371372); NSF of Fujian (No. 2014J01020); China Postdoctoral Science Foundation (No. 2014M551831); General Research Fund of Hong Kong; Faculty Research Grant of Hong Kong Baptist University.

## Authors’ Affiliations

## References

- Cvetković D, Rowlinson P, Simić S:
*An Introduction to the Theory of Graph Spectra*. Cambridge University Press, Cambridge; 2010.MATHGoogle Scholar - Chung F:
*Spectral Graph Theory*. Am. Math. Soc., Providence; 1997.MATHGoogle Scholar - Chen H, Jost J:
**Minimum vertex covers and the spectrum of the normalized Laplacian on trees.***Linear Algebra Appl.*2012,**437:**1089-1101. 10.1016/j.laa.2012.04.005MathSciNetView ArticleMATHGoogle Scholar - Rojo O, Soto RL:
**A new upper bounds on the largest normalized Laplacian eigenvalue.***Oper. Matrices*2013,**7:**323-332.MathSciNetView ArticleMATHGoogle Scholar - Banerjee, A: A few properties of the eigenvalues of normalized graph Laplacian (2012). arXiv:1210.5091v1 [math.CO] 1210.5091v1
- Butler, S: Eigenvalues and structures of graphs. PhD dissertation, University of California, San Diego (2008)Google Scholar
- Cavers, M: The normalized Laplacian matrix and general Randić index of graphs. PhD dissertation, University of Regina (2010)MATHGoogle Scholar
- Lu M, Liu H, Tian F:
**An improved upper bound for the Laplacian spectral radius of graphs.***Discrete Math.*2009,**309:**6318-6321. 10.1016/j.disc.2009.06.012MathSciNetView ArticleMATHGoogle Scholar - Guo J-M, Li J, Shiu WC:
**A note on the upper bounds for the Laplacian spectral radius of graphs.***Linear Algebra Appl.*2013,**439:**1657-1661. 10.1016/j.laa.2013.04.034MathSciNetView ArticleMATHGoogle Scholar - Cvetković D, Doob M, Sachs H:
*Spectra of Graphs*. Academic Press, New York; 1980.MATHGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.