 Research
 Open access
 Published:
Ordering nonbipartite unicyclic graphs with pendant vertices by the least Qeigenvalue
Journal of Inequalities and Applications volumeÂ 2016, ArticleÂ number:Â 136 (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:903909, 2013) and Liu et al. (Electron. J. Linear Algebra 26:333344, 2013) determined, independently, the unique unicyclic graph whose least Qeigenvalue attains the minimum among all nonbipartite unicyclic graphs of order n with k pendant vertices. In this paper, we extend their results and determine the first three nonbipartite unicyclic graphs of order n with k pendant vertices ordering by least Qeigenvalue.
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 Qmatrix) 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 Qeigenvalues 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 Qeigenvalue 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 nonbipartiteness of G. For a connected nonbipartite 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 nonbipartite 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 Qeigenvalue 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 Qeigenvalue. As an application, they minimized the least Qeigenvalue among the class of connected graphs with fixed order which contains a given nonbipartite graph as an induced subgraph. Recently, the problem of finding all graphs with the minimal least Qeigenvalue among a given class of graphs has been studied extensively. For related results, one may refer to [1, 2, 5â€“12].
A ccyclic graph G is a connected graph with n vertices and \(n+c1\) 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 Qeigenvalue attains the minimum among all nonbipartite unicyclic graphs of order n with k pendant vertices. In this paper, we extend their results and determine the first three nonbipartite unicyclic graphs of order n with k pendant vertices ordering by least Qeigenvalue.
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 nonbipartite 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 \(Guv\) 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 \(x=(x_{1}, x_{2}, \ldots, x_{n})^{T}\) be a column vector in \(\mathbb {R}^{n}\). Then x can be considered as a function defined on \(V(G)\), that is, each vertex \(v_{i}\) is given by the value \(x(v_{i})=x_{i}\). Then the quadratic form
Let \(\vert x(v)\vert \) denote the absolute value of \(x(v)\). If x is an eigenvector corresponding to a Qeigenvalue of G, then it defines on \(V(G)\) naturally, i.e. \(x(v)\) is the entry of x corresponding to v. For an arbitrary unit vector \(x\in\mathbb{R}^{n}\), one can find in [5, 13]
where equality holds if and only if x is an eigenvector corresponding to \(\kappa(G)\).
Let \(G_{1}\) and \(G_{2}\) be two vertexdisjoint 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])
Let G be a connected graph which contains a bipartite branch B with root v. Let x be an eigenvector of G corresponding to \(\kappa(G)\).

(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 nonbipartite 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])
Let \(G = C(v_{0})\diamond B(v_{0})\) be a graph of order n, where \(C=v_{0}v_{1}v_{2} \cdots v_{k} u_{k}u_{k1} \cdots u_{1}v_{0}\) is a cycle of length \(2k+1\), and B is a bipartite graph of order \(n2k>1\) (see FigureÂ 1). Let \(x=( x(v_{0}), x(v_{1}), x(v_{2}), \ldots, x(v_{k}), x(u_{1}), x(u_{2}), \ldots, x(u_{k}), \ldots )^{T}\) be an eigenvector corresponding to \(\kappa(G)\). Then

(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 nonbipartite 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])
Let G be a graph with n vertices and m edges. Then
where \(\operatorname {MaxCut}(G)\) denotes, as usual, the size of the largest bipartite subgraph ofÂ G.
For a ccyclic graph G, we have \(\operatorname {MaxCut}(G)\ge n1\). This implies the following lemma.
Lemma 2.6
Let G be a ccyclic graph. Then \(\kappa(G)\le\frac{4c}{n}\).
Lemma 2.7
([15])
Let G be a nonbipartite connected graph of order n with diameter D. Then \(\kappa(G) \geq\frac{1}{n(D+1)}\).
\(U_{n}^{k}(g)\), shown in FigureÂ 2, denotes the unicyclic graph of order n with odd girth g and k pendant vertices, where \(g+l+k=n\). \(C_{3}^{ 1}(nk1)\), \(C_{3}^{ 2}(nk1)\), and \(C_{3}^{1}(nk2)\) are the unicyclic graphs of order n with k pendant vertices, shown in Figures 2 and 3, respectively.
Lemma 2.8
Let \(3\le k \leq{(n4)}/\sqrt{6}\). Then \(\kappa(C_{3}^{ 2}(nk1))<\kappa(C_{3}^{1}(nk2))\).
Proof
Let \(\kappa=\kappa(C_{3}^{1}(nk2))\), and \(x=(x_{1}, x_{2}, \ldots, x_{n})^{T}\) be a unit eigenvector corresponding to Îº. Then \(\kappa =\sum_{v_{i}v_{j}\in E(C_{3}^{ 1}(nk2))}(x_{i}+x_{j})^{2}\) and \(0<\kappa<1\) (by LemmaÂ 2.6). From the eigenvalue equation \(Q(C_{3}^{1}(nk2))x =\kappa x\), we have \(x_{nk+2}=\cdots=x_{n}\),
and \(x_{n}\neq0\).
Let \(y=(y_{1}, y_{2}, \ldots, y_{n})^{T}\in \mathbb{R}^{n}\), which is defined on \(V(C_{3}^{ 2}(nk1))\), satisfy \(y_{nk+1}=(x_{nk1}+x_{nk2}+x_{nk+1})\), \(y_{nk+2}=(x_{nk1}+x_{nk+2}+x_{nk})\), and \(y_{i}=x_{i}\) for \(i=1, 2, \ldots, nk, nk+3,\ldots, n \). Then
and
Let \(f(t)={t^{5}}(2k+2){t^{4}}+(k^{2}+2k1){t^{3}}+(4k+6){t^{2}}(2k^{2}+6k+3)t+2\). It is not difficult to verify that \(f(t)>0\) for \(0 \le t \leq1/{(k^{2}+3k+2)}\).
Let \(z=(z_{1}, z_{2}, \ldots, z_{n})^{T} \in \mathbb{R}^{n}\), which is defined on \(V(C_{3}^{1}(nk2))\), satisfy \(z_{1}=z_{2}=0\), \(z_{nk+1}=(1)^{nk+1}(nk3)\),
Then, by (1) and \(3\le k \leq{(n4)}/\sqrt{6}\), we have
Therefore \(f(\kappa)>0\), and so
Combining the above arguments, we have
â€ƒâ–¡
Lemma 2.9
Let \(n\ge120\), \(k > \frac{3+\sqrt{21}}{2}n\). Then \(\kappa (C_{3}^{1}(nk2))< \kappa(C_{3}^{ 2}(nk1))\).
Proof
Let \(\kappa=\kappa(C_{3}^{ 2}(nk1))\), and \(x=(x_{1}, x_{2}, \ldots, x_{n})^{T}\) be a unit eigenvector corresponding to Îº. Then \(\kappa =\sum_{v_{i}v_{j}\in E(C_{3}^{ 2}(nk1))}(x_{i}+x_{j})^{2}\) and \(0<\kappa<1\). From the eigenvalue equation \(Q(C_{3}^{ 2}(nk1))x = \kappa x\), we have \(x_{nk+3}=\cdots=x_{n}\),
and \(x_{n}\neq0\).
Let \(y=(y_{1}, y_{2}, \ldots, y_{n})^{T}\in \mathbb{R}^{n}\), which is defined on \(V(C_{3}^{1}(nk2))\), satisfy that \(y_{nk+1}=(x_{nk1}+x_{nk2}+x_{nk+1})\), \(y_{nk+2}=(x_{nk1}+x_{nk+2}+x_{nk})\), and \(y_{i}=x_{i}\) for \(i=1, 2, \ldots, nk, nk+3, nk+4, \ldots, n\). Then
and
Let
Then \(f(0)=6\). From \(n\ge120\) and \(k> \frac{3+\sqrt{21}}{2}n\), we have \(k > \frac{3+\sqrt{21}}{2}n>94\), and
for \(0\le t \leq1/30\). So \(f(t)\) is strictly decreasing with respect to t in \([0,1/30]\). Recalling that \(k > \frac{3+\sqrt{21}}{2}n\), by Lemmas 2.6 and 2.7, we find that
This implies that \(f(\kappa)<0\) and
It follows that
â€ƒâ–¡
3 Main results
Let \(\mathcal{U}_{ n}^{k}\) be the set of nonbipartite 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 Qeigenvalue 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 Qeigenvalues.
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 n4\). Among all graphs in \(\mathcal{U}_{ n}^{k}\backslash\{U_{n}^{k}(3)\}\), \(C_{3}^{1}(nk1)\) is the unique graph whose least Qeigenvalue attains the minimum.
Proof
Let G be a graph in \(\mathcal{U}_{ n}^{k}\backslash\{ U_{n}^{k}(3)\}\) whose least Qeigenvalue 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)\).
First, we show that G is the cycle \(C_{g}=v_{1}v_{2}\cdots v_{g}v_{1}\) with only one nontrivial tree attached. Otherwise, we assume that there are more than one nontrivial trees attached at two different vertices of the cycle \(C_{g}\). Let \(v_{t}\) be a vertex of the cycle \(C_{g}\) such that \(\vert x_{t}\vert \geq \vert x_{i}\vert \) for \(i=1, 2, \ldots, g\). By LemmaÂ 2.1, \(x_{t}\neq0\). Let \(v_{l}\) be another vertex of the cycle \(C_{g}\) such that \(\vert V(T_{l})\vert >1\), and let
From \(k\le n4\), we have \(G_{1}\in\mathcal{U}_{n}^{k} \backslash\{ U_{n}^{k}(3)\}\). By LemmaÂ 2.4, we have \(\kappa(G_{1})<\kappa(G)\), a contradiction. Therefore G is the cycle \(C=v_{1}v_{2}\cdots v_{g}v_{1}\) with only one nontrivial tree attached. Without loss of generality, we may assume the nontrivial tree is \(T_{g}\).
Second, we show that \(g=3\). Otherwise, we assume that \(g\ge5\). By LemmaÂ 2.3, we have \(x_{(g3)/2}=x_{(g+3)/2}\). Let
Clearly, \(G '\in\mathcal{U}_{ n}^{k+1}\), and from (1) we have
Let \(v_{t}\) be a pendant vertex of G, and \(y=(y_{1}, y_{2}, \ldots, y_{n})^{T}\) be a unit eigenvector corresponding to \(\kappa(G ')\). By LemmaÂ 2.2, we have \(\vert y_{t}\vert > \vert y_{g}\vert >0\). Let \(G ''=G 'v_{1}v_{g}+v_{1}v_{t}\). It is easy to see that \(G ''\in\mathcal{U}_{ n}^{k}\backslash\{ U_{n}^{k}(3)\}\). By LemmaÂ 2.4, we have \(\kappa(G '')<\kappa(G ')\). Then we have \(\kappa(G '')<\kappa(G)\), a contradiction. Therefore \(g=3\).
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 '=Gv_{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 '=Gv_{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}(nk1)\).â€ƒâ–¡
For \(k=n3\), \(\mathcal{U}_{ n}^{ n3}=\{\Delta_{r, s, t} \mid r\ge s\ge t\ge0, r+s+t=n3 \}\), 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
Let \(n\ge8\), and \(G\in\mathcal{U}_{ n}^{n3}\backslash\{\Delta _{n3, 0, 0}, \Delta_{n4, 1, 0}, \Delta_{n5, 2, 0}\}\). Then
Next, we will determine the graph in \(\mathcal{U}_{ n}^{k}\backslash\{ U_{n}^{k}(3), C_{3}^{1}(nk1)\}\) whose least Qeigenvalue attains the minimum.
Theorem 3.3
Let \(2\le k\le n5\). Among all graphs in \(\mathcal{U}_{ n}^{k}\backslash\{U_{n}^{k}(3), C_{3}^{1}(nk1)\}\), \(C_{3}^{ 1}(nk2)\) or \(C_{3}^{ 2}(nk1)\) is the graph whose least Qeigenvalue attains the minimum.
Proof
Let G be a graph in \(\mathcal{U}_{ n}^{k}\backslash\{ U_{n}^{k}(3), C_{3}^{1}(nk1)\}\) whose least Qeigenvalue 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 '=Gv_{b}v_{t}+v_{c}v_{t}\). Clearly, \(G '\in\mathcal{U}_{ n}^{k}\backslash\{U_{n}^{k}(3), C_{3}^{1}(nk1)\}\) 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 '=Gv_{b}v_{t}+v_{a}v_{t}\). Clearly, \(G '\in\mathcal{U}_{ n}^{k}\backslash\{U_{n}^{k}(3), C_{3}^{1}(nk1)\}\) and \(\kappa(G ')<\kappa(G)\), a contradiction. Therefore \(d(v_{b})=3\) and \(G=C_{3}^{1}(nk2)\).
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 '=Gv_{b}v_{t}+v_{a}v_{t}\). Clearly, \(G '\in\mathcal{U}_{ n}^{k}\backslash\{U_{n}^{k}(3), C_{3}^{1}(nk1)\}\) and \(\kappa(G ')<\kappa(G)\), a contradiction. Therefore \(d(v_{b})=4\) and \(G=C_{3}^{2}(nk1)\).
From the above arguments, we have \(G=C_{3}^{1}(nk1)\) or \(C_{3}^{2}(nk1)\).â€ƒâ–¡
For \(k=n4\), \(\mathcal{U}_{ n}^{ n4}=\{C_{3}^{ r, s, t, l} \mid l\ge1, r\ge0, s\ge0, t\ge0, r+s+t+l=n4 \}\), where \(C_{3}^{ r, s, t, l}\), shown in FigureÂ 4, denotes the unicyclic graph of order n with \(n4\) pendant vertices. \(C_{3}^{ 1}(2)\) and \(C_{3}^{ 2}(3)\), shown in FigureÂ 4, are the unicyclic graphs of order n with \(n4\) pendant vertices.
Theorem 3.4
Let \(n\ge7\). Among all graphs in \(\mathcal{U}_{ n}^{ n4}\backslash \{U_{n}^{ n4}(3), C_{3}^{1}(3)\}\), \(C_{3}^{ 1}(2)\) is the unique graph whose least Qeigenvalue attains the minimum.
Proof
By a similar reasoning to that of TheoremÂ 3.3, we can prove that \(C_{3}^{ 2}(3)\) or \(C_{3}^{ 1}(2)\) is the graph whose least Qeigenvalue attains the minimum among all graphs in \(\mathcal{U}_{ n}^{ n4}\backslash\{U_{n}^{ n4}(3), C_{3}^{1}(3)\}\). Let \(\kappa=\kappa(C_{3}^{ 2}(3))\) and let \(x=(x_{1}, x_{2}, \ldots, x_{n})^{T}\) be an eigenvector corresponding to Îº. From the eigenvalue equations, we have \(x_{1}=x_{2}\), \(x_{5}=x_{6}\), \(x_{7}=\cdots=x_{n}\),
Since x is an eigenvector, it follows that \(\kappa=\kappa(C_{3}^{ 2}(3))\) is the least root of the equation
By an easy computation, we can obtain
Similarly, from the eigenvalue equation, we can prove that \(\kappa(C_{3}^{ 1}(2))\) is the least root of
By LemmaÂ 2.6, we have \(0<\kappa(C_{3}^{ 2}(3)), \kappa (C_{3}^{ 1}(2))\le4/n\). Note that for \(n\ge12\),
for \(0< x\le4/n\). It follows that \(g(\kappa(C_{3}^{ 2}(3)))<0\). This implies that \(\kappa(C_{3}^{ 1}(2))<\kappa(C_{3}^{ 2}(3))\).
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{(n4)}/{\sqrt{6}}\). Among all graphs in \(\mathcal {U}_{ n}^{k}\backslash\{U_{n}^{k}(3), C_{3}^{ 1}(nk1)\}\), \(C_{3}^{ 2}(nk1)\) is the unique graph whose least Qeigenvalue 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}(nk1)\}\), \(C_{3}^{1}(nk2)\) is the unique graph whose least Qeigenvalue attains the minimum.
4 Discussion
According to Lemmas 2.8 and 2.9, we propose the following conjecture.
Conjecture 4.1
There exists a real number Î± with \(0<\alpha<1\) such that, for any \(\varepsilon>0\), there exists a sufficiently large N such that
for all \(n\ge N\) and all \(3\le k \le(\alpha\varepsilon) n\), and
for all \(n\ge N\) and all \((\alpha+\varepsilon) n\le k \le n5 \).
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.
References
Fan, YZ, Wang, Y, Guo, H: The least eigenvalues of signless Laplacian of nonbipartite graphs with pendant vertices. Discrete Math. 313, 903909 (2013)
Liu, RF, Wan, HX, Yuan, JJ, Jia, HC: The least eigenvalue of the signless Laplacian of nonbipartite unicyclic graphs with k pendant vertices. Electron. J. Linear Algebra 26, 333344 (2013)
Desai, M, Rao, V: A characterization of the smallest eigenvalue of a graph. J.Â Graph Theory 18, 181194 (1994)
Cardoso, DM, CvetkoviÄ‡, D, Rowlinson, P, SimiÄ‡, SK: A sharp lower bound for the least eigenvalue of the signless Laplacian of a nonbipartite graph. Linear Algebra Appl. 429, 27702780 (2008)
Wang, Y, Fan, YZ: The least eigenvalue of signless Laplacian of graphs under perturbation. Linear Algebra Appl. 436, 20842092 (2012)
Fan, YZ, Tan, YY: The least eigenvalue of signless Laplacian of nonbipartite graphs with given domination number. Discrete Math. 334, 2025 (2014)
Guo, SG, Xu, ML, Yu, GL: On the least signless Laplacian eigenvalue of nonbipartite unicyclic graphs with both given order and diameter. Ars Comb. 114, 385395 (2014)
Li, SC, Wang, SJ: The least eigenvalue of the signless Laplacian of the complements of trees. Linear Algebra Appl. 436, 23982405 (2012)
Wen, Q, Zhao, Q, Liu, HQ: The least signless Laplacian eigenvalue of nonbipartite graphs with given stability number. Linear Algebra Appl. 476, 148158 (2015)
Yu, GL, Guo, SG, Xu, ML: On the least signless Laplacian eigenvalue of some graphs. Electron. J. Linear Algebra 26, 560573 (2013)
Yu, GL, Guo, SG, Zhang, R, Wu, YR: The domination number and the least Qeigenvalue. Appl. Math. Comput. 244, 274282 (2014)
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, 213236 (2014)
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, 25702584 (2011)
He, CX, Zhou, M: Least Qeigenvalue of a graph. J.Â East China Norm. Univ. Natur. Sci. Ed. 3, 15 (2012) (in Chinese)
Acknowledgements
The first author is very grateful to Professor YongGao 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).
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authorsâ€™ contributions
All authors completed the paper together. All authors read and approved the final manuscript.
Rights and permissions
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.
About this article
Cite this article
Guo, SG., Liu, X., Zhang, R. et al. Ordering nonbipartite unicyclic graphs with pendant vertices by the least Qeigenvalue. J Inequal Appl 2016, 136 (2016). https://doi.org/10.1186/s1366001610771
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s1366001610771