On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
- Shu-Guang Guo^{1}Email author and
- Rong Zhang^{1}
https://doi.org/10.1186/s13660-017-1395-y
© The Author(s) 2017
Received: 25 January 2017
Accepted: 8 May 2017
Published: 22 May 2017
Abstract
In this paper, we determine the unique graph whose least signless Laplacian eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with maximum degree Δ and among all non-bipartite connected graphs of order n with maximum degree Δ, respectively.
Keywords
non-bipartite graph signless Laplacian least eigenvalue maximum degreeMSC
05C501 Introduction
All graphs considered in this paper are finite, simple and undirected. Let G be a graph with vertex set \(V=V(G)= \{v_{1}, v _{2}, \ldots, v_{n}\}\) and edge set \(E=E(G)\). Write \(A(G)\) for the adjacency matrix of G and let \(D(G)\) be the diagonal matrix of the degrees of G. The matrix \(Q(G)=D(G)+ A(G)\) is called the signless Laplacian matrix of G. As usual, let \(q_{1}(G)\ge q_{2}(G) \ge \cdots\ge q_{n}(G)\ge0\) denote the eigenvalues of \(Q(G)\) and call them the signless Laplacian eigenvalues of G. Denote by \(\kappa(G)\) the least eigenvalue of G.
For a connected graph G, \(\kappa(G) = 0\) if and only if G is bipartite. Desai and Rao [1] suggest the use of \(\kappa(G)\) as a measure of non-bipartiteness of G. Fallat and Fan [2] introduce two parameters reflecting the graph bipartiteness, and establish a relationship between \(\kappa(G)\) and the two parameters. de Lima, Nikiforov and Oliveira [3] point out that \(\kappa(G)\) depends more on the distribution of the edges of a graph than on their number, so it may become a useful tool in extremal graph theory. For a connected non-bipartite graph G with given order, how small can \(\kappa(G)\) be? Cardoso et al. [4] propose this problem and show that the minimum value of \(\kappa(G)\) is attained uniquely in the unicyclic graph obtained from the cycle \(C_{3}\) by attaching a path at one of its end vertices. Motivated by this problem, a good deal of attention has been devoted to finding all graphs with the minimal least signless Laplacian eigenvalue among a given class of graphs. For related results, one may refer to [5–14].
A unicyclic graph is a connected graph with a unique cycle. Let \(\Delta=\Delta(G)\) be the maximum degree of a graph G. In this paper, we determine the unique graph whose least signless Laplacian eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with maximum degree Δ and among all non-bipartite connected graphs of order n with maximum degree Δ, respectively.
The rest of the paper is organized as follows. In Section 2, we recall some notions and lemmas used further, and prove three new lemmas. In Section 3, we prove two theorems which is our main result. In Section 4, we propose two problems for further research.
2 Preliminaries
Denote by \(C_{n}\) the cycle on n vertices. Let \(G-uv\) denote the graph which arises from G by deleting the edge \(uv\in E(G)\). Similarly, \(G+uv\) is the graph that arises from G by adding an edge \(uv\notin E(G)\), where \(u, v\in V(G)\). For \(v\in V(G)\), \(N(v)\) denotes the neighborhood of v in G and \(d(v)=\vert N(v)\vert \) denotes the degree of vertex v. A pendant vertex of G is a vertex of degree 1. \(\vert x\vert \) denotes the absolute value of a real number x. The terminology not defined here can be found in [15].
Lemma 2.1
[16]
Let \(G_{1}\) and \(G_{2}\) be two vertex-disjoint connected graphs, and let \(v_{i}\in V(G_{i})\) for \(i=1, 2\). Identifying the \(v_{1}\) with \(v_{2}\) and forming a new vertex u (see [10] for details), the resulting graph is called coalescence of \(G_{1}\) and \(G_{2}\), and denoted by \(G_{1}(v_{1})\diamond G_{2}(v_{2})\) or \(G_{1}(u)\diamond G _{2}(u)\). If a connected graph G can be expressed in the form \(G_{1}(u)\diamond G_{2}(u)\), where \(G_{1}\) and \(G_{2}\) are both nontrivial and connected, then \(G_{1}\) is called a branch of G with root u. Clearly \(G_{2}\) is also a branch of G with root u. Let \(x\in R^{n}\) be a vector defined on \(V(G)\). A branch \(G_{i}\) of G is called a zero branch with respect to x if \(x(v) = 0\) for all \(v \in V(G_{i})\); otherwise it is called a nonzero branch with respect to x.
Lemma 2.2
[10]
- (i)
If \(x(u) = 0\), then B is a zero branch of G with respect to x.
- (ii)
If \(x(u)\neq0\), then \(x(v)\neq0\) for every vertex \(v\in V(B)\).
Lemma 2.3
[10]
Let G be a non-bipartite connected graph, and let x be an eigenvector corresponding to \(\kappa(G)\). Let T be a tree, which is a nonzero branch of G with respect to x and with root u. Then \(\vert x(q)\vert < \vert x(p)\vert \) whenever p, q are vertices of T such that q lies on the unique path from u to p.
Lemma 2.4
[12]
- (i)
\(\vert x(v_{0})\vert =\max\{\vert x(w)\vert \vert w\in V(C)\}>0\);
- (ii)
\(x(v_{i})=x(u_{i})\) for \(i=1, 2, \ldots, k\).
Lemma 2.5
[12]
Let \(G = G_{1}(v_{2}) \diamond T(u)\) and \(G^{*} = G_{1}(v_{1})\diamond T(u)\), where \(G_{1}\) is a non-bipartite connected graph containing two distinct vertices \(v_{1}\), \(v_{2}\), and T is a nontrivial tree. If there exists an eigenvector \(x=( x(v_{1}),x(v_{2}),\ldots,x(v_{k}),\ldots)^{T}\) corresponding to \(\kappa(G)\) such that \(\vert x(v_{1})\vert > \vert x(v_{2})\vert \) or \(\vert x(v_{1})\vert = \vert x(v_{2})\vert > 0\), then \(\kappa(G^{*})<\kappa(G)\).
For \(k \ge1\), let \(G'\) denote the graph obtained from G by deleting the edge uv, inserting k new vertices \(v_{1}, v_{2}, \ldots, v _{k}\) and adding edges \(uv_{1}, v_{1}v_{2}, \ldots, v_{k-1}v_{k}, v _{k}v\). Then \(G'\) is called a k-subdivision graph of G by k-subdividing the edge uv.
Lemma 2.6
[17]
Let \(G'\) be a k-subdivision graph of a graph G. If k is even, then \(\kappa(G')\le\kappa(G)\).
Lemma 2.7
Among all non-bipartite connected graphs on n vertices with k pendant vertices, \(U_{n}^{k}(3)\) is the unique graph whose signless Laplacian eigenvalue attains the minimum.
Lemma 2.8
[5]
Let \(k\ge2\), and \(g\ge3\) be an odd integer. Then \(\kappa(U_{n}^{k-1}(g))< \kappa(U_{n}^{k}(g))\).
Lemma 2.9
Let \(G = G_{1}(v)\diamond B(v)\) be a connected graph, where \(G_{1}\) is a graph of order n, and B is a bipartite graph of order s. Then \(\kappa(G ) \le\kappa(G_{1})\). Moreover, if \(s>1\), \(G_{1}\) is non-bipartite and there exists an eigenvector x corresponding to \(\kappa(G_{1})\) such that \(x(v)\neq0\), then \(\kappa(G )<\kappa(G_{1})\).
Proof
Lemma 2.10
Proof
Lemma 2.11
Proof
3 Main results
Let \(\mathcal{U}(n, \Delta)\) be the set of non-bipartite unicyclic graphs of order n with maximum degree Δ, and \(\mathcal{G}(n, \Delta)\) be the set of non-bipartite connected graphs of order n with maximum degree Δ. In this section, we firstly determine the unicyclic graph whose signless Laplacian eigenvalue attains the minimum among all graphs in \(\mathcal{U}(n, \Delta)\).
Theorem 3.1
Let \(4\le\Delta\le n-3\). Among all graphs in \(\mathcal{U}(n, \Delta)\), \(U_{n}^{ \Delta-1}(3)\) is the unique graph whose signless Laplacian eigenvalue attains the minimum.
Proof
Let \(G\in\mathcal{U}(n, \Delta)\), and \(C_{g}=v_{1}v_{2}\ldots v _{g}v_{1}\) be the unique cycle of G. Then g is odd, and G can be obtained by attaching trees \(T_{1},T_{2},\ldots,T_{g}\) to the vertices \(v_{1},v_{2},\ldots,v_{g}\) of \(C_{g}\), respectively, where \(T_{i}\) contains the root vertex \(v_{i}\) for \(i=1,2, \ldots, g\). \(\vert V(T_{i})\vert =1\) means \(V(T_{i})=\{v_{i}\}\). Suppose that G has k pendant vertices. It is easy to see \(\Delta\le k+2\). Let \(x=(x_{1}, x _{2}, \ldots, x_{n})^{T}\) be a unit eigenvector corresponding to \(\kappa(G)\).
Case 1. \(\Delta\le k+1\). By Lemma 2.7, we have \(\kappa(U_{n}^{ k}(3))\le\kappa(G)\) with equality if and only if \(G=U_{n}^{ k}(3)\). By Lemma 2.8, we have \(\kappa(U_{n}^{ \Delta-1}(3))\le\kappa(U_{n}^{ k}(3))\) with equality if and only if \(\Delta=k+1\). It follows that \(\kappa(U_{n}^{ \Delta-1}(3))\le \kappa(G)\) with equality if and only if \(G=U_{n}^{ \Delta-1}(3)\).
Case 2. \(\Delta=k+2\). Then G must be the graph obtained from the cycle \(C_{g}\) with k pendant paths \(P_{i_{1}},\ldots,P_{i_{k}}\) attached at the same vertex \(v_{1}\) of \(C_{g}\), and \(k\ge2\).
Secondly, we determine the graph whose least signless Laplacian eigenvalue attains the minimum among all graphs in \(\mathcal{G}(n, \Delta)\).
Theorem 3.2
Let \(4\le\Delta\le n-3\). Among all graphs in \(\mathcal{G}(n, \Delta)\), \(U_{n}^{ \Delta-1}(3)\) is the unique graph whose least signless Laplacian eigenvalue attains the minimum.
Proof
Remark 3.3
For \(\Delta=2\), we know that \(\mathcal{G}(n, 2)=\{C_{n}\}\) with n being odd. For \(\Delta=3\), from [4], we know that \(U_{n}^{ 1}(3)\) is the unique graph whose least signless Laplacian eigenvalue attains the minimum among all graphs in \(\mathcal{G}(n, 3)\). For \(\Delta=n-1\), \(\mathcal{U}(n, n-1)=\{S_{n}^{*}\}\), where \(S_{n}^{*}\) is obtained by adding one edge to the star \(K_{1, n-1}\). Let \(G\in\mathcal{G}(n, n-1)\setminus\{S_{n}^{*}\}\), then G is obtained from \(S_{n}^{*}\) by adding at least one edge. By a similar reasoning to that of Theorem 3.2, we can show that \(\kappa(S_{n}^{*})< \kappa(G)\). For \(\Delta=n-2\), \(\mathcal{U}(n, n-2)=\{ S_{n-1}^{*+1}, S_{n-1}^{*+2} \}\), where \(S_{n-1}^{*+1}\) is obtained from \(S_{n-1}^{*}\) by adding one pendant edge to a vertex of degree 1, and \(S_{n-1}^{*+2}\) is obtained from \(S_{n-1}^{*}\) by adding one pendant edge to a vertex of degree 2. From Lemmas 2.5, 2.4 and 2.6, we may obtain \(\kappa(S_{n-1}^{*+1})<\kappa(S_{n-1} ^{*+2})\). Let \(G\in\mathcal{G}(n, n-2)\setminus\{ S_{n-1}^{*+1}, S_{n-1}^{*+2} \}\), then G is obtained from \(S_{n-1}^{*+1}\) or \(S_{n-1}^{*+2}\) by adding at least one edge. By a similar reasoning to that of Theorem 3.2, we can show that \(\kappa(S_{n-1}^{*+1})<\kappa (G)\).
4 Discussion
- (1)
Characterize all extremal graphs whose least signless Laplacian eigenvalue attains the minimum among all non-bipartite unicyclic graphs with a given degree sequence.
- (2)
Characterize all extremal graphs whose least signless Laplacian eigenvalue attains the minimum among all non-bipartite connected graphs with a given degree sequence.
Declarations
Acknowledgements
This work is supported by the National Natural Science Foundation of China (Nos. 11171290, 11271315) and the Natural Science Foundation of Jiangsu Province (BK20151295).
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Authors’ Affiliations
References
- Desai, M, Rao, V: A characterization of the smallest eigenvalue of a graph. J. Graph Theory 18, 181-194 (1994) MathSciNetView ArticleMATHGoogle Scholar
- Fallat, S, Fan, YZ: Bipartiteness and the least eigenvalue of signless Laplacian of graphs. Linear Algebra Appl. 436, 3254-3267 (2012) MathSciNetView ArticleMATHGoogle Scholar
- de Lima, LS, Nikiforov, V, Oliveira, CS: The clique number and the smallest Q-eigenvalue of graphs. Discrete Math. 339, 1744-1752 (2016) MathSciNetView ArticleMATHGoogle Scholar
- Cardoso, DM, Cvetković, D, Rowlinson, P, Simić, SK: A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph. Linear Algebra Appl. 429, 2770-2780 (2008) MathSciNetView ArticleMATHGoogle Scholar
- Fan, YZ, Wang, Y, Guo, H: The least eigenvalues of signless Laplacian of non-bipartite graphs with pendant vertices. Discrete Math. 313, 903-909 (2013) MathSciNetView ArticleMATHGoogle Scholar
- Fan, YZ, Tan, YY: The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number. Discrete Math. 334, 20-25 (2014) MathSciNetView ArticleMATHGoogle Scholar
- Guo, SG, Liu, X, Zhang, R, Yu, G: Ordering non-bipartite unicyclic graphs with pendant vertices by the least Q-eigenvalue. J. Inequal. Appl. 2016, 136 (2016) MathSciNetView ArticleMATHGoogle Scholar
- Li, SC, Wang, SJ: The least eigenvalue of the signless Laplacian of the complements of trees. Linear Algebra Appl. 436, 2398-2405 (2012) MathSciNetView ArticleMATHGoogle Scholar
- Liu, RF, Wan, HX, Yuan, JJ, Jia, HC: The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices. Electron. J. Linear Algebra 26, 333-344 (2013) MathSciNetMATHGoogle Scholar
- Wang, Y, Fan, YZ: The least eigenvalue of signless Laplacian of graphs under perturbation. Linear Algebra Appl. 436, 2084-2092 (2012) MathSciNetView ArticleMATHGoogle Scholar
- Wen, Q, Zhao, Q, Liu, HQ: The least signless Laplacian eigenvalue of non-bipartite graphs with given stability number. Linear Algebra Appl. 476, 148-158 (2015) MathSciNetView ArticleMATHGoogle Scholar
- Yu, GL, Guo, SG, Xu, ML: On the least signless Laplacian eigenvalue of some graphs. Electron. J. Linear Algebra 26, 560-573 (2013) MathSciNetView ArticleMATHGoogle Scholar
- Yu, GL, Guo, SG, Zhang, R, Wu, YR: The domination number and the least Q-eigenvalue. Appl. Math. Comput. 244, 274-282 (2014) MathSciNetView ArticleMATHGoogle Scholar
- Yu, GD, Fan, YZ, Wang, Y: Quadratic forms on graphs with application to minimizing the least eigenvalue of signless Laplacian over bicycle graphs. Electron. J. Linear Algebra 27, 213-236 (2014) MathSciNetView ArticleMATHGoogle Scholar
- Cvetković, D: Spectral theory of graphs based on the signless Laplacian. Research report. http://www.mi.sanu.ac.rs/projects/signless_L_reportApr11.pdf (2010)
- Heuvel, JVD: Hamilton cycles and eigenvalues of graphs. Linear Algebra Appl. 226-228, 723-730 (1995) MathSciNetView ArticleMATHGoogle Scholar
- He, CX, Pan, H: The smallest signless Laplacian eigenvalue of graphs under perturbation. Electron. J. Linear Algebra 23, 473-482 (2012) MathSciNetView ArticleMATHGoogle Scholar
- de Lima, LS, Oliveira, CS, de Abreu, NMM, Nikiforov, V: The smallest eigenvalue of the signless Laplacian. Linear Algebra Appl. 435, 2570-2584 (2011) MathSciNetView ArticleMATHGoogle Scholar