Laplacian integral signed graphs with few cycles

: A connected graph with n vertices and m edges is called k - cyclic graph if k = m − n + 1 . We call a signed graph is Laplacian integral if all eigenvalues of its Laplacian matrix are integers. In this paper, we will study the Laplacian integral k -cyclic signed graphs with k = 0 , 1 , 2 , 3 and determine all connected Laplacian integral signed trees, unicyclic, bicyclic and tricyclic signed graphs.


Introduction
All graphs considered here are simple and undirected. The vertex set and edge set of a graph G will be denoted by V(G) and E(G), respectively. A signed graph Γ = (G, σ) consists of an unsigned graph G = (V, E) and a sign function σ : E(G) → {+1, −1}. The G is its underlying graph, while σ its sign function (or signature). An edge v i v j is positive (negative) if σ(v i v j ) = +1 (resp. σ(v i v j ) = −1). If a signed graph has the all-positive (resp. all-negative) signature, then it is denoted by (G, +) (resp. (G, −)).
The adjacency matrix of a signed graph Γ is defined by A σ = A(Γ) = (σ i j ), where σ i j = σ(v i v j ) if v i ∼ v j , and σ i j = 0 otherwise. The Laplacian matrix of a signed graph Γ is defined by L σ = L(Γ) = L(G, σ) = D(G) − A(Γ), where D(G) is the diagonal matrix of vertex degrees. The Laplacian eigenvalues µ 1 ≥ µ 2 ≥ · · · ≥ µ n of a signed graph Γ are identified to be the eigenvalues of L(Γ). Recently, the spectra of the signed graphs have attracted many studies, see [1-3, 7, 18, 19].
A graph is called integral (resp. Laplacian integral, signless Laplacian integral) if all eigenvalues of its adjacency matrix (resp. Laplacian matrix, signless Laplacian matrix) are integers. This notion was first introduced by Harary and Schwenk in [8], who proposed the problem of classifying all integral graphs. The study of this problem has fascinated many mathematicians. In [4] and [16], Cvetković and Schwenk classified the connected integral graphs of maximum degree at most 3. In [14], Kirkland proved that there are 21 connected Laplacian integral graphs of maximum degree 3 on at least 6 vertices. For more results about (Laplacian) integral graphs see [5,6,9]. Integral and Laplacian integral signed graphs are defined in the same way. Very recently, there have some interests in characterizing the (Laplacian) integral signed graphs. In [18] and [19], the authors characterized all connected integral subcubic signed graphs and all connected Laplacian integral subcubic signed graphs, respectively. In [17], Stanić determined all integral 4-regular net-balanced signed graphs and the integral 4-regular net-balanced signed graphs whose net-balance is a simple eigenvalue.
A connected graph with n vertices and m edges is called a k-cyclic graph if k = m − n + 1. A k-cyclic graph (k ≥ 1) is said to be a k-cyclic base graph if contains no pendent vertices. In particular, the tree and unicyclic, bicyclic and tricyclic graph are respectively defined as the k-cyclic graph with k = 0, 1, 2 and 3. In [15], Liu and Liu determined all Laplacian integral unicyclic and bicyclic graphs. In [12], Huang et al. determined all Laplacian integral tricyclic graphs. In [13], Zhang et al. determined all signless Laplacian integral unicyclic, bicyclic and tricyclic graphs. Note that L(G, +) = L(G) and L(G, −) = Q(G) = D(G) + A(G), where L(G) and Q(G) are the Laplacian matrix and the signless Laplacian matrix of G, respectively. Thus L(G, σ) can be viewed as a common generalization of the L(G) and Q(G) of the underlying graph G. So there arises a natural problem: which unicyclic, bicyclic and tricyclic signed graphs are Laplacian integral? In this paper, we will generalize the results of [12,13,15] and characterize all connected Laplacian integral signed trees, unicyclic, bicyclic and tricyclic signed graphs.
Most of the concepts defined for graphs can be directly extended to signed graphs. For example, the degree of a vertex v in G (denoted by d v ) is also its degree in Γ, ∆(Γ) and δ(Γ) denote the maximum degree and minimum degree of vertex, respectively. If d v = 1, then we call v a pendent vertex of Γ. Let K n,m denote the complete bipartite graph. In all figures of signed graphs in this paper, positive edges are depicted as thin lines, while negative edges are depicted as dashed lines. For other undefined notationss and terminology from the theory of signed graphs, we refer to Zaslavsky [20].

Preliminaries
First we will present some basic results about signed graphs. Let Γ = (G, σ) be a signed graph and C a cycle of Γ. The sign of C is denoted by σ(C) = e∈C σ(e). A cycle whose sign is +1 (resp. −1) is called positive (resp. negative). A signed graph is called balanced if all its cycles are positive, otherwise it is called unbalanced. Throughout this paper, we denote a positive and a negative cycle of length n by C + n and C − n , respectively. For Γ = (G, σ) and U ⊂ V(G), let Γ U be the signed graph obtained from Γ by reversing the signatures of the edges in the cut [U, V(G) \ U], namely σ Γ U (e) = −σ Γ (e) for any edge e between U and V(G) \ U, and σ Γ U (e) = σ Γ (e) otherwise. The signed graph Γ U is said to be switching equivalent to Γ, and we write Γ ∼ Γ U . Switching equivalence leaves the many signed graphic invariants, such as adjacency spectrum and Laplacian spectrum.
The following lemma is used to prove two signed graphs are switching equivalent.
T. Indeed, given any prescribed sign function σ T : T −→ {+1, −1}, each switching class has a single representative which agrees with σ T on T.
Hou et al. [11] provided a basic result about the µ n (Γ) of a signed graph Γ. From Lemma 2.2, we have the following observations.
By Proposition 2.3, we can obtain that if Γ = (G, σ) is a connected unbalanced Laplacian integral signed graph, then δ(Γ) ≥ 2 and hence Γ has no pendent vertex.
Proof. Suppose u is a pendent vertex and v is the neighbor of u, then 2 × 2 principal submatrix of L σ − I corresponding to u and v equals We have det S = −1, which contradicts to Proposition 2.3 (ii). Hence δ(Γ) ≥ 2. □ Corollary 2.5. Let Γ = (G, σ) be a connected unbalanced Laplacian integral k-cyclic signed graph. Then the underlying graph G is a k-cyclic base graph.
Proof. By Lemma 2.4, we know that Γ has no pendent vertex. Hence the underlying graph G is a k-cyclic base graph. □ By Proposition 2.3 (ii), we can also give a considerable reduction on the possible induced subgraphs.
Lemma 2.6. Let Γ = (G, σ) be a connected unbalanced Laplacian integral signed graph. If there are two vertices of degree 2 such that they are adjacent, then there must exist one negative 3-cycle that contains vertices u and v.
Proof. Suppose that w is the another neighbor of u, by Lemma 2.1, we can assume that σ(vu) = σ(uw) = +1. Then the 3 × 3 principal submatrix of L σ − I corresponding to v, u, w equals By direct calculations, we have det S = −1 if σ(vw) = 0 and det S = −4 if σ(vw) = +1, which contradicts to Proposition 2.3 (ii). Thus σ(vw) = −1 and {v, u, w} is a negative 3-cycle. This completes the proof. □ It is straightforward to see that if Γ = (G, σ) is a connected signed graph with maximam degree at most 2, then the necessarily the underlying graph G is a path or cycle.
Lemma 2.8. [19] Let Γ = (G, σ) be a connected unbalanced Laplacian integral signed graph of maximum degree 3. Then Γ is switching equivalent to one of the signed graphs of Figure 1.
The following three lemmas characterize the connected Laplacian integral unicyclic, bicyclic and tricyclic unsigned graphs. Let S 1 (n) (n ≥ 4) denote the (unique) unicyclic graph obtained from K 1,n−1 by adding one edge between pendent vertices of K 1,n−1 .
Lemma 2.9. [15, Theorem 3.2] If G is a connected unicyclic graph of order n (n ≥ 3), then G is Laplacian integral if and only if G S 1 (n), G C 3 , G C 4 , G C 6 .
Let S 1 2 (n) and S 2 2 (n) (n ≥ 5) denote the two bicyclic graphs obtained from K 1,n−1 by adding two edge to the pendent vertices of K 1,n−1 . See Figure 2.   Figure 3. Laplacian integral tricyclic graphs.

Laplacian integral signed graphs with few cycles
In this section, we will characterize the connected Laplacian integral k-cyclic signed graphs with k = 0, 1, 2 and 3.
If k = 0, it is known that the underlying graph G is a tree. Then Proof. Note that any signed tree shares the same L-spectrum with its underlying graph. Hence by Corollary 3.1 of [15] , Γ is Laplacian integral if and only if Γ ∼ (K 1,n−1 , +). □ Now we will determine all connected Laplacian integral unicyclic signed graphs.
Theorem 3.2. If Γ = (G, σ) is a connected unicyclic signed graph of order n (n ≥ 3), then Γ is Laplacian integral if and only if Γ is switching equivalent to C + 3 , C − 3 , C + 4 , C + 6 or (S 1 (n), +). Proof. If Γ is balanced, then Γ is Laplacian integral if and only if it is switching equivalent to C + 3 , C + 4 , C + 6 or (S 1 (n), +) (by Lemma 2.9). Then we consider the unbalanced case. By Corollary 2.5, we know that the the underlying graph G must be a cycle. So Γ is an unbalanced signed cycle C − n . Hence by Lemma 2.7, we can obtain that Γ is switching equivalent to C − 3 . This completes the proof. □ Next we consider the connected Laplacian integral bicyclic signed graphs. It is well-known that there are three types of bicyclic graphs in term of their base graph as described next (see Figure 4). The type B 1 is the union of three internally disjoint paths P p+2 , P q+2 , and P r+2 which have the same two distinct end vertices, where p ≥ 0, q ≥ 0 and r ≥ 0.
The type B 2 consists of two vertex disjoint cycles C a and C b joined by a path P r having only its end vertices in common with the cycles, where a ≥ 3, b ≥ 3 and r ≥ 2.
The type B 3 is the union of two cycles C a and C b with precisely one vertex in common, where a ≥ 3 and b ≥ 3.  Proof. If Γ is balanced, then Γ is Laplacian integral if and only if it is switching equivalent to (S 1 2 (n), +), (S 2 2 (n), +) (K 2,3 , +), (F, +) or (H, +) (by Lemma 2.10). Then we consider the unbalanced case. By Corollary 2.5, then the underlying graph G is a bicyclic base graph. Further, note that all bicyclic signed graphs of types B 1 and B 2 have maximum degree 3. Thus, by Lemma 2.8, we can get that Γ = (G, σ) (where G ∈ B 1 or B 2 ) is Laplacian integral if and only if Γ ∼ Γ 2 . Hence it suffices to consider that the underlying graph G ∈ B 3 . By Lemma 2.6, we can obtain that a = b = 3, because otherwise there have at least one pair of adjacent vertices of degree 2 and no triangle contains these two vertices. Thus the underlying graph G is graph that two triangles meet at one vertex.
It is easy to check that there is no Laplacian integral signed graph on G. So we complete the proof. □ By Corollary 2.5, to determine the Laplacian integral tricyclic signed graph, it suffices to consider that the underlying graph is the tricyclic base graph. It is well-known that there are exactly 15 types of tricyclic base graphs [10] (see Figure 6), which are denoted by T i , for i = 1, 2, . . . , 15. Let T σ i (i = 1, 2, . . . , 15) be the set of tricyclic signed graphs whose underlying graph belongs to T i .
Because of Lemma 2.11, we will focus on the connected unbalanced Laplacian integral tricyclic signed graphs.

Conclusions
In this research work, we analyzed some properties of the connected unbalanced Laplacian integral k-cyclic signed graphs and investigated all connected Laplacian integral k-cyclic signed graphs with k = 0, 1, 2, 3. In future work, we will study the integral k-cyclic signed graphs for more general sets of matrices than Laplacian matrix.