Ordering non-bipartite unicyclic graphs with pendant vertices by the least Q-eigenvalue
- Shu-Guang Guo^{1}Email author,
- Xiaorong Liu^{1, 2},
- Rong Zhang^{1} and
- Guanglong Yu^{1}
https://doi.org/10.1186/s13660-016-1077-1
© Guo et al. 2016
Received: 1 October 2015
Accepted: 28 April 2016
Published: 10 May 2016
Abstract
A unicyclic graph is a connected graph whose number of edges is equal to the number of vertices. Fan et al. (Discrete Math. 313:903-909, 2013) and Liu et al. (Electron. J. Linear Algebra 26:333-344, 2013) determined, independently, the unique unicyclic graph whose least Q-eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with k pendant vertices. In this paper, we extend their results and determine the first three non-bipartite unicyclic graphs of order n with k pendant vertices ordering by least Q-eigenvalue.
Keywords
MSC
1 Introduction
Let \(G=(V, E)\) be a simple undirected graph with vertex set \(V=V(G)= \{v_{1}, v_{2}, \ldots, v_{n}\}\) and edge set \(E=E(G)\), where n is called the order of G. Let \(A(G)\) be the adjacency matrix of a graph G and let \(D(G)=\operatorname {diag}(d_{G}(v_{1}), d_{G}(v_{2}),\ldots, d_{G}(v_{n}))\) be the diagonal matrix of degrees of G, where \(d_{G}(v)\) or simply \(d(v)\) denotes the degree of a vertex v in G. The matrix \(Q(G)=D(G)+ A(G)\) is called the signless Laplacian matrix (or Q-matrix) of G. Since \(Q(G)\) is symmetric and positive semidefinite, it follows that its eigenvalues are real and nonnegative. We simply call the eigenvalues of \(Q(G)\) as the signless Laplacian eigenvalues or Q-eigenvalues of G. As usual, we shall index the eigenvalues of \(Q(G)\) in nonincreasing order and denote them as \(q_{1}(G)\ge q_{2}(G)\ge\cdots\ge q_{n}(G)\ge 0\). Denote by \(\kappa(G)\) the least Q-eigenvalue of G.
For a connected graph G, Desai and Rao [3] showed that \(\kappa (G) = 0\) if and only if G is bipartite, and suggested that \(\kappa (G)\) can be used as a measure of non-bipartiteness of G. For a connected non-bipartite graph G, how small can \(\kappa(G)\) be? Cardoso et al. [4] proposed this problem and proved that the minimum value of \(\kappa(G)\) of a connected non-bipartite graph G of order n is attained solely in the unicyclic graph that arises from a cycle of order 3 by attaching a path at one of its end vertices. Wang and Fan [5] investigated how the least Q-eigenvalue of a graph changes when a bipartite branch attached at one vertex is relocated to another vertex and proved a perturbation theorem on the least Q-eigenvalue. As an application, they minimized the least Q-eigenvalue among the class of connected graphs with fixed order which contains a given non-bipartite graph as an induced subgraph. Recently, the problem of finding all graphs with the minimal least Q-eigenvalue among a given class of graphs has been studied extensively. For related results, one may refer to [1, 2, 5–12].
A c-cyclic graph G is a connected graph with n vertices and \(n+c-1\) edges. Specially, if \(c = 0\), 1, or 2, then G is a tree, a unicyclic graph, or a bicyclic graph, respectively. Very recently, Fan et al. [1] and Liu et al. [2] determined, independently, the unique unicyclic graph whose least Q-eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with k pendant vertices. In this paper, we extend their results and determine the first three non-bipartite unicyclic graphs of order n with k pendant vertices ordering by least Q-eigenvalue.
The rest of the paper is organized as follows. In Section 2, we recall some basic notions and lemmas used further, and prove two new lemmas. In Section 3, we order non-bipartite unicyclic graphs of order n with k pendant vertices. In Section 4, a conjecture is proposed.
2 Preliminaries
Denote by \(C_{n}\) the cycle of order n. Let \(G-uv\) denote the graph obtained from G by deleting the edge \(uv\in E(G)\). Similarly, \(G+uv\) is the graph obtained from G by adding an edge \(uv\notin E(G)\), where \(u, v\in V(G)\). We write \(d_{G}(u, v)\) or simply \(d(u, v)\) for the distance in G between vertices u and v. The diameter of a connected graph G is the maximum distance between pairs of vertices in \(V(G)\). For \(v\in V(G)\), \(N_{G}(v)\) or simply \(N(v)\) denotes the neighborhood of v in G. A pendant vertex of G is a vertex of degree 1. A pendant neighbor of G is a vertex adjacent to a pendant vertex.
Let \(G_{1}\) and \(G_{2}\) be two vertex-disjoint graphs, and let \(v_{1}\in V(G_{1})\), \(v_{2}\in V(G_{2})\). \(G_{1}(v_{1})\diamond G_{2}(v_{2})\) denotes the coalescence of \(G_{1}\) and \(G_{2}\), which arises from \(G_{1}\), \(G_{2}\) by identifying \(v_{1}\) with \(v_{2}\) and forming a new vertex u (see [5] for details). The graph \(G_{1}(v_{1})\diamond G_{2}(v_{2})\) is also written as \(G_{1}(u)\diamond G_{2}(u)\). If a graph G can be expressed in the form \(G = G_{1}(u)\diamond G_{2}(u)\), where \(G_{1}\) and \(G_{2}\) are both connected and nontrivial, then \(G_{i}\) is called a branch of G with root u for \(i=1, 2\). Let x be a vector defined on \(V(G)\). A branch H of G is called a zero branch with respect to x if \(x(v) = 0\) for all \(v \in V(H)\); otherwise it is called a nonzero branch with respect to x.
Lemma 2.1
([5])
- (i)
If \(x(v) = 0\), then B is a zero branch of G with respect to x.
- (ii)
If \(x(v)\neq0\), then \(x(p)\neq0\) for every vertex \(p\in V(B)\).
Lemma 2.2
([5])
Let G be a connected non-bipartite graph of order n, and let x be an eigenvector of G corresponding to \(\kappa(G)\). Let T be a tree, which is a nonzero branch of G with respect to x and with root v. 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 v to p.
Lemma 2.3
([10])
- (i)
\(\vert x(v_{0})\vert =\max\{\vert x(w)\vert \mid w\in V(C)\}>0\);
- (ii)
\(x(v_{i})=x(u_{i})\) for \(i=1, 2, \ldots, k\).
Lemma 2.4
([10])
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}\) of G 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)\).
Lemma 2.5
([14])
For a c-cyclic graph G, we have \(\operatorname {MaxCut}(G)\ge n-1\). This implies the following lemma.
Lemma 2.6
Let G be a c-cyclic graph. Then \(\kappa(G)\le\frac{4c}{n}\).
Lemma 2.7
([15])
Let G be a non-bipartite connected graph of order n with diameter D. Then \(\kappa(G) \geq\frac{1}{n(D+1)}\).
Lemma 2.8
Let \(3\le k \leq{(n-4)}/\sqrt{6}\). Then \(\kappa(C_{3}^{ 2}(n-k-1))<\kappa(C_{3}^{1}(n-k-2))\).
Proof
Lemma 2.9
Let \(n\ge120\), \(k > \frac{-3+\sqrt{21}}{2}n\). Then \(\kappa (C_{3}^{1}(n-k-2))< \kappa(C_{3}^{ 2}(n-k-1))\).
Proof
3 Main results
Let \(\mathcal{U}_{ n}^{k}\) be the set of non-bipartite unicyclic graphs of order n with k pendant vertices. From [1, 2], we know that \(U_{n}^{k}(3)\) is the unique graph whose least Q-eigenvalue attains the minimum among all graphs in \(\mathcal{U}_{ n}^{k}\). In this section, we will determine the first three graphs in \(\mathcal{U}_{ n}^{k}\) ordered according to their least Q-eigenvalues.
For \(k=1\), from [1], we know that \(\kappa(U_{n}^{1}(3))<\kappa (U_{n}^{1}(5))<\kappa(U_{n}^{1}(7))<\cdots\) .
Theorem 3.1
Let \(2\le k\le n-4\). Among all graphs in \(\mathcal{U}_{ n}^{k}\backslash\{U_{n}^{k}(3)\}\), \(C_{3}^{1}(n-k-1)\) is the unique graph whose least Q-eigenvalue attains the minimum.
Proof
Let G be a graph in \(\mathcal{U}_{ n}^{k}\backslash\{ U_{n}^{k}(3)\}\) whose least Q-eigenvalue attains the minimum, and \(C_{g}=v_{1}v_{2}\cdots v_{g}v_{1}\) be the unique cycle of G. Then g is odd, and G can be obtained by attaching rooted trees \(T_{1}, \ldots, T_{g}\) to the vertices \(v_{1}, \ldots, v_{g}\) of \(C_{g}\), respectively, where \(T_{i}\) contains the root vertex \(v_{i}\). \(\vert V(T_{i})\vert =1\) means that \(V(T_{i})=\{v_{i}\}\) and in this case \(T_{i}\) is a trivial tree. Let \(x=(x_{1}, x_{2}, \ldots, x_{n})^{T}\) be a unit eigenvector corresponding to \(\kappa(G)\).
Third, we show that G has two pendant neighbors exactly. Otherwise, suppose that G has \(r\ge3\) pendant neighbors. Let \(v_{a}\) be a pendant neighbor of G such that \(d(v_{3}, v_{a})\) is as large as possible, \(v_{s}\) and \(v_{t}\) be two other pendant neighbors of G. Applying Lemma 2.4 to \(v_{s}\) and \(v_{t}\), we may obtain a graph \(G '\in\mathcal{U}_{ n}^{k}\backslash\{U_{n}^{k}(3)\}\) or \(G '\in \mathcal{U}_{ n}^{k+1}\) such that \(\kappa(G ')<\kappa(G)\). If \(G '\in\mathcal{U}_{ n}^{k}\backslash \{U_{n}^{k}(3)\}\), we have a contradiction. If \(G '\in\mathcal{U}_{ n}^{k+1}\), without loss of generality, we may assume that \(v_{s}\) is a pendant vertex of \(G '\). Let u and w be two pendant vertices adjacent to \(v_{t}\) of \(G '\), and \(G ''=G '-v_{t}w+uw\). Clearly, \(G ''\in\mathcal{U}_{ n}^{k}\backslash\{U_{n}^{k}(3)\}\) and \(\kappa(G '')<\kappa(G ')\). Then we have \(\kappa(G '')<\kappa(G)\), a contradiction. Therefore G has two pendant neighbors exactly. Let \(v_{a}\) be a pendant neighbor of G such that \(d(v_{3}, v_{a})\) is as large as possible, and \(v_{b}\) be another pendant neighbor of G.
Fourth, we show that \(v_{b}\) is in path \(v_{3}-v_{a}\). Otherwise, suppose that \(v_{b}\) is not in path \(v_{3}-v_{a}\). Employing Lemma 2.4 to vertices \(v_{a}\) and \(v_{b}\), we may obtain a graph \(G '\in\mathcal {U}_{ n}^{k+1}\) such that \(\kappa(G ')<\kappa(G)\). Without loss of generality, we may assume that \(v_{b}\) is a pendant vertex of \(G '\). Let u and w be two pendant vertices adjacent to \(v_{a}\) of \(G '\), and \(G ''=G '-v_{a}w+uw\). Clearly, \(G ''\in\mathcal{U}_{ n}^{k}\backslash\{U_{n}^{k}(3)\}\) and \(\kappa(G '')<\kappa(G ')\). Then we have \(\kappa(G '')<\kappa(G)\), a contradiction. Therefore \(v_{b}\) is in path \(v_{3}-v_{a}\).
Fifth, we show that \(v_{a}\) and \(v_{b}\) are adjacent. Otherwise, suppose that \(v_{a}\) and \(v_{b}\) are not adjacent. Let \(v_{c}\in N(v_{b})\) be in path \(v_{b}-v_{a}\), then, by Lemma 2.4, we have \(\vert x_{c}\vert >\vert x_{b}\vert \). Let \(v_{t}\) be the pendant vertex adjacent to \(v_{b}\) and \(G '=G-v_{b}v_{t}+v_{c}v_{t}\). Clearly, \(G '\in\mathcal{U}_{ n}^{k}\backslash\{U_{n}^{k}(3)\}\) and by Lemma 2.4 we have \(\kappa(G ')<\kappa(G)\), a contradiction. Therefore \(v_{a}\) and \(v_{b}\) are adjacent.
Sixth, we show that \(d(v_{b})=3\). Otherwise, suppose that \(d(v_{b})>3\). Let \(v_{t}\) be the pendant vertex adjacent to \(v_{b}\) and \(G '=G-v_{b}v_{t}+v_{a}v_{t}\). Clearly, \(G '\in\mathcal{U}_{ n}^{k}\backslash\{U_{n}^{k}(3)\}\). By Lemma 2.4, we have \(\vert x_{a}\vert >\vert x_{b}\vert \), and by Lemma 2.4, we have \(\kappa(G ')<\kappa(G)\), a contradiction. Therefore \(d(v_{b})=3\).
From the above arguments, we have \(G=C_{3}^{1}(n-k-1)\). □
For \(k=n-3\), \(\mathcal{U}_{ n}^{ n-3}=\{\Delta_{r, s, t} \mid r\ge s\ge t\ge0, r+s+t=n-3 \}\), where \(\Delta_{r, s, t}\) is the graph obtained from the cycle \(C_{3}\) by attaching r, s, t pendent edges to the vertices \(v_{1}\), \(v_{2}\), and \(v_{3}\) of the cycle \(C_{3}\), respectively. By a similar reasoning to that of Theorem 3.1, we can prove the following theorem.
Theorem 3.2
Next, we will determine the graph in \(\mathcal{U}_{ n}^{k}\backslash\{ U_{n}^{k}(3), C_{3}^{1}(n-k-1)\}\) whose least Q-eigenvalue attains the minimum.
Theorem 3.3
Let \(2\le k\le n-5\). Among all graphs in \(\mathcal{U}_{ n}^{k}\backslash\{U_{n}^{k}(3), C_{3}^{1}(n-k-1)\}\), \(C_{3}^{ 1}(n-k-2)\) or \(C_{3}^{ 2}(n-k-1)\) is the graph whose least Q-eigenvalue attains the minimum.
Proof
Let G be a graph in \(\mathcal{U}_{ n}^{k}\backslash\{ U_{n}^{k}(3), C_{3}^{1}(n-k-1)\}\) whose least Q-eigenvalue attains the minimum, and let \(x=(x_{1}, x_{2}, \ldots, x_{n})^{T}\) be a unit eigenvector corresponding to \(\kappa(G)\). By a similar reasoning to that of Theorem 3.1, we can prove that G is the cycle \(C=v_{1}v_{2}v_{3}v_{1}\) with only one nontrivial tree \(T_{3}\) attached at \(v_{3}\), and G has two pendant neighbors exactly. Let \(v_{a}\) be a pendant neighbor of G such that \(d(v_{3}, v_{a})\) is as large as possible, and \(v_{b}\) be another pendant neighbor of G. By a similar reasoning to that of Theorem 3.1, we can prove that \(v_{b}\) is in path \(v_{3}-v_{a}\).
Now we show that \(d(v_{b}, v_{a})\le2\). Otherwise, suppose that \(d(v_{b}, v_{a})\ge3\). Let \(v_{t}\) be the pendant vertex adjacent to \(v_{b}\) and \(v_{c}\in N(v_{b})\) be in path \(v_{b}-v_{a}\). Then, by Lemma 2.4, we have \(\vert x_{c}\vert >\vert x_{b}\vert \). Let \(G '=G-v_{b}v_{t}+v_{c}v_{t}\). Clearly, \(G '\in\mathcal{U}_{ n}^{k}\backslash\{U_{n}^{k}(3), C_{3}^{1}(n-k-1)\}\) and \(\kappa(G ')<\kappa(G)\), a contradiction. Therefore \(d(v_{b}, v_{a})\le2\).
If \(d(v_{b}, v_{a})=2\), then we declare \(d(v_{b})=3\). Otherwise, suppose that \(d(v_{b})\ge4\). Let \(v_{t}\) be the pendant vertex adjacent to \(v_{b}\) and let \(G '=G-v_{b}v_{t}+v_{a}v_{t}\). Clearly, \(G '\in\mathcal{U}_{ n}^{k}\backslash\{U_{n}^{k}(3), C_{3}^{1}(n-k-1)\}\) and \(\kappa(G ')<\kappa(G)\), a contradiction. Therefore \(d(v_{b})=3\) and \(G=C_{3}^{1}(n-k-2)\).
If \(d(v_{b}, v_{a})=1\), then we declare \(d(v_{b})=4\). Otherwise, suppose that \(d(v_{b})\ge5\). Let \(v_{t}\) be the pendant vertex adjacent to \(v_{b}\) and let \(G '=G-v_{b}v_{t}+v_{a}v_{t}\). Clearly, \(G '\in\mathcal{U}_{ n}^{k}\backslash\{U_{n}^{k}(3), C_{3}^{1}(n-k-1)\}\) and \(\kappa(G ')<\kappa(G)\), a contradiction. Therefore \(d(v_{b})=4\) and \(G=C_{3}^{2}(n-k-1)\).
From the above arguments, we have \(G=C_{3}^{1}(n-k-1)\) or \(C_{3}^{2}(n-k-1)\). □
Theorem 3.4
Let \(n\ge7\). Among all graphs in \(\mathcal{U}_{ n}^{ n-4}\backslash \{U_{n}^{ n-4}(3), C_{3}^{1}(3)\}\), \(C_{3}^{ 1}(2)\) is the unique graph whose least Q-eigenvalue attains the minimum.
Proof
For \(7\le n\le11\), by computation, we can verify that \(\kappa(C_{3}^{ 1}(2))<\kappa(C_{3}^{ 2}(3))\).
From the above arguments, we have \(\kappa(C_{3}^{ 1}(2))<\kappa(C_{3}^{ 2}(3))\) for \(n\ge7\). □
Combining Theorem 3.3 and Lemma 2.8, we have the following theorem.
Theorem 3.5
Let \(3\le k \leq{(n-4)}/{\sqrt{6}}\). Among all graphs in \(\mathcal {U}_{ n}^{k}\backslash\{U_{n}^{k}(3), C_{3}^{ 1}(n-k-1)\}\), \(C_{3}^{ 2}(n-k-1)\) is the unique graph whose least Q-eigenvalue attains the minimum.
Combining Theorem 3.3 and Lemma 2.9, we have the following theorem.
Theorem 3.6
Let \(n\ge120\), \(k > \frac{-3+\sqrt{21}}{2}n\). Among all graphs in \(\mathcal{U}_{ n}^{k}\backslash\{U_{n}^{k}(3), C_{3}^{1}(n-k-1)\}\), \(C_{3}^{1}(n-k-2)\) is the unique graph whose least Q-eigenvalue attains the minimum.
4 Discussion
According to Lemmas 2.8 and 2.9, we propose the following conjecture.
Conjecture 4.1
If Conjecture 4.1 is true, then, by Lemmas 2.8 and 2.9, \(\sqrt{6}/6\le\alpha\le(\sqrt{21}-3)/2\), where α is the same as in Conjecture 4.1.
Declarations
Acknowledgements
The first author is very grateful to Professor Yong-Gao Chen for his help. 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
- 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
- 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
- Desai, M, Rao, V: A characterization of the smallest eigenvalue of a graph. J. Graph Theory 18, 181-194 (1994) 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
- Wang, Y, Fan, YZ: The least eigenvalue of signless Laplacian of graphs under perturbation. Linear Algebra Appl. 436, 2084-2092 (2012) 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, Xu, ML, Yu, GL: On the least signless Laplacian eigenvalue of non-bipartite unicyclic graphs with both given order and diameter. Ars Comb. 114, 385-395 (2014) MathSciNetMATHGoogle 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
- 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) MathSciNetMATHGoogle 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)
- 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
- He, CX, Zhou, M: Least Q-eigenvalue of a graph. J. East China Norm. Univ. Natur. Sci. Ed. 3, 1-5 (2012) (in Chinese) MathSciNetMATHGoogle Scholar