In this article, we investigate connected signed graphs which have a connected star complement for both and 2 (i.e. simultaneously for the two eigenvalues), where (resp. 2) is the least (largest) eigenvalue of the adjacency matrix of a signed graph under consideration. We determine all such star complements and their maximal extensions (again, relative to both eigenvalues). As an application, we provide a new proof of the result which identifies all signed graphs that have no eigenvalues other than and 2.
A signed graph is a pair , where is an (unsigned) graph , called the underlying graph, and is the sign function or signature. The order of , denoted by , is the number of its vertices. The edge set of consists of positive and negative edges determined by . We interpret a graph as a signed graph whose signature assigns 1 to each edge.
The adjacency matrix of is the -matrix of size obtained from the adjacency matrix of its underlying graph by reversing the sign of each entry which corresponds to a negative edge. The eigenvalues of are the eigenvalues of its adjacency matrix, and they form the spectrum of .
We consider connected star complements (this notion is defined in the next section) for as the least eigenvalue which are simultaneously star complements for 2 as the largest eigenvalue. We determine all such star complements and their maximal extensions. As an application we provide a new proof of the result from [1,2,3] which determines all signed graphs with exactly two distinct eigenvalues: and 2. This result is interesting because, according to , a signed graph whose spectrum lies in is an induced subgraph of a signed graph with eigenvalues and 2.
Section 2 is preparatory. Our contribution is reported in Sections 3 and 4.
We use and to denote the least and the largest eigenvalue of a signed graph, respectively.
For a subset , let denote the signed graph obtained by switching the sign of the edges between and . The signed graphs and are said to be switching equivalent.
A cycle in a signed graph is said to be positive if the product of its edge signs is 1. Otherwise, it is said to be negative. A signed graph is balanced if it does not contain a negative cycle, for otherwise it is unbalanced.
In the reminder of this section, we introduce the concepts of star complements and signed line graphs. The first concept is a natural extension of the concept developed in the framework of unsigned graphs and can also be found in . The second concept, which can be found in [5,6], is tailored for the spectral theory of signed graphs and differs in sign from that of .
2.1 Star complements in signed graphs
Let be a signed graph. A subset of is said to be a star set for the eigenvalue of multiplicity if and is not an eigenvalue of . The induced subgraph is the corresponding star complement for .
The following result is a “signed” generalization of the well-known Reconstruction theorem [8, Theorem 5.1.7].
Letbe a signed graph with
If is a star set for the eigenvalue , , and has order , then we define a bilinear form on as follows:
Also, if then we write for the characteristic vector of the neighbourhood of in the corresponding star complement; this vector carries the signs of the corresponding edges.
From Theorem 2.1 we have:
We now introduce some additional terminology and notation related to star complements. Given a signed graph , we fix a vertex and a subset , and we let be a signed graph obtained by inserting an edge between and every vertex of and taking a particular signature for these edges. If is an eigenvalue of but is not an eigenvalue of , we say that , and are a good vertex, a good set, and a good extension for , respectively. Moreover, we say that the vertices are compatible for (and the same is said for the corresponding sets ) if are good and . Theorem 2.1 tells us that a vertex set in which all vertices are good and compatible in pairs affords a good extension in which and are a star set and a star complement for . If such a signed graph is not a proper induced subgraph of some other signed graph with the same star complement for the same eigenvalue, then is referred to as a maximal signed graph with star complement for or a maximal extension of for .
2.2 Signed line graphs
Given a signed graph , we introduce the vertex-edge orientation which obeys (a) if , (b) or , and (c) . Since each edge receives two orientations, is also referred to as a bi-orientation. A bi-directed graph consists of together with the bi-orientation .
The (vertex-edge) incidence matrix is the matrix whose rows and columns are indexed by the vertices and the edges of , respectively, such that its -entry is equal to . We have
where is taken to be the signed line graph of . Note that depends on the bi-orientation , but a different bi-orientation results in a switching equivalent signed graph. Therefore, we have a signed line graph of which is unique up to switching, and we denote it by . In this context, is called a signed root graph (of ).
Since is positive semidefinite, we have . A signed graph that is not a signed line graph, but whose least eigenvalue is , is called an exceptional signed graph.
In a signed graph, two parallel edges (located between the same pair of vertices) form a cycle of length 2 called a digon. A digon is positive if its edges have the same sign, and negative if they differ in sign. In particular, the existence of a positive digon in implies the existence of parallel edges in . Also, a negative digon produces non-adjacent vertices in . A signed graph which allows parallel edges if and only if they form negative digons is called a simply signed graph. Accordingly, has no multiple edges if and only if is a simply signed graph.
Moreover, given an unsigned graph , we define the signed doubled graph as the signed graph obtained by inserting a parallel negative edge between every pair of adjacent vertices of . We know from  that if is regular of order and vertex degree , then the spectrum of is , where in the exponential notation, the exponent stands for the eigenvalue multiplicity.
The following result is taken from . Recall that a connected signed graph whose order is equal to its number of edges is called unicyclic.
A connected signed graphwithbelongs to one of the following classes:
Signed line graphs of trees.
Signed line graphs of unbalanced unicyclic simply signed graphs.
Exceptional signed graphs whose least eigenvalue is.
We know from [9,10] that the signed graphs of Lemma 2.2(iii) have at most eight vertices.
3 Star complements for
We start by determining the potential star complements for in the role of the least and the largest eigenvalue.
The spectrum of a connected signed graphlies inif and only ifis switching equivalent to an induced subgraph of (at least) one of the signed graphs illustrated in Figure 1.
First, we confirm by inspection that the spectrum of each of the first ten signed graphs in Figure 1 lies in , and the same holds for their induced subgraphs by the eigenvalue interlacing argument. For the remaining two (the negative quadrangle with two hanging paths and the negative even cycle), we observe that both are signed line graphs and in both cases the corresponding root is an unbalanced unicyclic simply signed graph. Therefore, their least eigenvalues are greater than by Lemma 2.2(ii). Moreover, since both are bipartite, their spectra are symmetric about 0, and we are done.
Conversely, let be a connected signed graph whose spectrum lies in . First, does not contain an odd cycle as an induced subgraph, since depending on the signature for such a cycle we have either or (where and are defined at the beginning of Section 2). Next, cannot contain a positive even cycle as an induced subgraph, for otherwise both and are at least 2. Hence, all induced cycles in are negative and of even length. We proceed with more restrictions:
cannot contain an induced negative even cycle with at least eight vertices and a hanging edge. (Otherwise, would contain the Smith graph obtained by attaching a hanging edge at the central vertex of a 7-vertex path, with .)
cannot contain an induced signed graph in which two negative even cycles share more than one edge. (Observe that such an induced graph necessarily contains a negative odd cycle or a positive even cycle as an induced subgraph.)
By examining connected signed graphs with negative even cycles of length at most six and taking into account the restrictions of (i) and (ii), we arrive at the desired solutions.□
We denote the order of a star complement by and proceed by determining maximal extensions of the candidates for star complements with . According to the previous theorem, there are five types of possible star complements for and 2: (a) the negative quadrangle with two paths attached at its non-adjacent vertices, (b) the negative quadrangle with a single path attached at one of its vertices, (c) a path with an edge attached at the vertex labelled 2, (d) a path, and (e) an even negative cycle. We demonstrate two methods, one in case (a) and the other in case (c), and then comment on the remaining cases.
We start with the star complement (a) for both .
For, is the unique maximal extension of the signed graph (a) for.
Since , the maximal extension, say , is a signed line graph. We observe next that the star complement is also a signed line graph of a -vertex path with a negative digon; we denote this signed root graph by . Therefore, is obtained by inserting the maximum number of edges in and then taking the signed line graph of the resulting root graph. Note that the edges between non-adjacent vertices of are disallowed since their existence produces positive triangles in which cannot exist because the largest eigenvalue of a positive triangle with an attached edge is greater than 2. The remaining edges are the two edges (one positive and the other negative) between the pendant vertices of and the edges that form negative digons. By inserting all of them we obtain the signed graph of Figure 2. This is , and its spectrum is in (from the formula in Section 2). Therefore, is indeed the maximal extension for and 2. This extension is unique since it includes all possible good vertices.□
We now investigate the graph (c) by a different method. We denote this graph by and observe that is a subgraph of the last but one signed graph of Figure 1, and so we can transfer the vertex labelling from this figure. If is the adjacency matrix of , then the matrix is
which can be confirmed by direct computation. Thus for , the th row of the upper triangle of the symmetric matrix is .
We first eliminate the possibility that has at least four neighbours in . (We recall the reader that the vertex and the corresponding set are defined in Section 2.1.)
Ifis good, then.
If , then (as odd triangles are disallowed) necessarily contains as an induced subgraph, with . If , then by simple reasoning we conclude that, unless or and , contains a forbidden induced subgraph that is a negative odd cycle with a hanging edge, or a positive even cycle with a hanging edge, or with an edge attached at one of its pendant vertices. The critical cases are considered by inspection, and the lemma follows.□
Next we determine the good vertices for .
With the notation above, a vertexand a corresponding setare good foras a star complement forif and only if one of the following holds:
, and eitheris one of, , , , , , whereand the edges fromalternate in sign, or.
We set . Evidently is good for 2 if and only if , where the bilinear form is determined by the matrix (1).
Suppose first that , and let be adjacent to the vertices 1, 2, and . We have
For , we have (otherwise, contains the positive quadrangle with a hanging edge), and so without loss of generality we may assume that . This leads to , and so if and only if . For , we obtain with . Since in both situations the spectrum of is symmetric, we also have that is good for , and (i) is completed.
Now suppose that is adjacent to 1, , and (). In a very similar way, we find that with . Hence , with the solutions (iv) computed directly.
Finally, if is adjacent to (), then we have with . The equality holds only for and , but in this case contains a negative triangle with a hanging edge, and this implies .
Suppose now that . Then since in this case either or is a signed line graph of an unbalanced unicyclic simply signed graph with . If is adjacent to 1 and (), we find that , and as before along with the given solutions. If is adjacent to and (), we have , and thus is good for 2 if and only if . Simultaneously, is good for since its spectrum is symmetric. This completes (ii).
For we find easily that is good for if and only if or , in both cases along with , and (for any ). In this way, we have completed (iv) and (iii).□
For the determination of maximal extensions we need the following simple lemma. For a (not necessarily good) vertex we denote by the vertex obtained by taking a copy of (with the same neighbourhood in ) and switching the sign of all edges incident with .
A vertexis good forif and only ifis good for. Ifis good, thenare compatible if and only if.
With the notation of Theorem 2.1, the first part of this lemma follows from . For the second part, if is good then we have , which means that are compatible if and only if .□
Now we proceed with maximal extensions.
For, is the unique maximal extension of for .
We first consider compatibility between the vertices of Lemma 3.4(i)–(iii). It is convenient to compute the vectors for defined by (1). With the enumeration of this lemma we find that
Observe now that a vertex is never compatible with the vertex defined upon Lemma 3.5. Compatibility between the remaining vertices is given in the scheme below. For example, if are of type (ii), then
which gives the assertion.
|Type of||Type of||Compatibility|
|(i.b)||(ii)||, unless when with|
|(i.b)||(iii)||, unless when with|
|(ii)||(ii)||, unless when with|
|(ii)||(iii)||, unless when with|
It follows that good vertices for can be partitioned into two halves in such a way that for every good vertex , its non-compatible pair belongs to different half. In addition, by the scheme above all vertices in one half are mutually compatible and comprise a maximal extension, while the vertices of the other half lead to a switching equivalent extension. In other words, there is a unique maximal extension of (for ). We construct it on the basis of the vertex compatibility, and obtain .□
In the same way, we find that the maximal extension of is the second signed graph of Figure 3. For the remaining candidates for star complements (those of (b), (d), and (e)) one can choose between the foregoing methods. (Observe that all of them are signed line graphs, and so the first method is applicable.) The first method is restricted to , and the resulting maximal extension is unchanged. For and the remaining potential star complements (those of Figure 1 and their connected induced subgraphs) we can choose between a direct computation and brute force, i.e. a computer search which can be performed very quickly since the signed graphs under consideration are of small order. In any case, we obtain just two solutions that deviate from , namely the signed graphs illustrated in Figure 3; one can easily deduce that both are exceptional.
4 Signed graphs with spectrum
Now we are ready to give an alternative proof of the result in [1,2,3].
A connected signed graph has spectrumif and only if it is one of the signed graphs illustrated inFigures 2and3.
With a slight modification in the proof of [8, Theorem 5.1.6] we get that every signed graph has a connected star complement for each of its eigenvalues. Therefore, the result follows unless there is a connected signed graph, say , with given spectrum for which there is no common star complement for and 2. In this case, has vertices and contains a connected star complement, say , for , but not for 2, which implies .
If is a signed line graph, then by Lemma 2.2 is the signed line graph of either a tree or an unbalanced unicyclic simply signed graph.
In the former case, we find that contains a positive triangle with a hanging edge (along with a contradiction ) unless is a complete unsigned graph, but in this case we have , which is easily resolved (a triangle in the role of leads to ).
In the latter case, we have the same situation (a positive triangle with a hanging edge) unless is the unbalanced quadrangle with at most two hanging paths (Figure 1) or is a positive cycle. In the first case, contrary to the assumption, we have . In the second case, by considering good vertices we find that can be transformed into a star complement common to both eigenvalues.
The situation in which is exceptional is resolved by inspecting potential star complements with six, seven, and eight vertices.□
We note that exceptional signed graphs with eight vertices of Figure 1 are star complements for the second signed graph of Figure 3, while their induced subgraphs with seven vertices correspond to the first signed graph of the same figure.
We conclude our consideration with the following characterization.
Every signed graph with spectrumis determined by one of the following star complements for: , or the negative hexagon with a hanging edge, or the negative hexagon with two hanging edges attached at vertices at distance 3.
The result follows from Theorem 4.1 and the subsequent discussion.□
The authors are grateful to the anonymous referees for the comments and suggestions for improvements. Raffaella Mulas was supported by the Max Planck Society’s Minerva Grant. Zoran Stanić was supported by the Serbian Ministry of Education, Science and Technological Development via the University of Belgrade, Faculty of Mathematics.
Conflict of interest: Authors state no conflict of interest.
Data availability statement: Not applicable.
 Y. Hou , Z. Tang , D. Wang , On signed graphs with just two distinct adjacency eigenvalues, Discrete Math. 342 (2019), 111615. 10.1016/j.disc.2019.111615Search in Google Scholar
 J. McKee , C. Smyth , Integer symmetric matrices having all their eigenvalues in the interval [ −2,2 ], J. Algebra 317 (2007), 260–290. 10.1016/j.jalgebra.2007.05.019Search in Google Scholar
 Z. Stanić , Spectra of signed graphs with two eigenvalues, Appl. Math. Comput. 364 (2020), 124627. 10.1016/j.amc.2019.124627Search in Google Scholar
 Z. Stanić , A decomposition of signed graphs with two eigenvalues, Filomat. 34 (2020), 1949–1957. 10.2298/FIL2006949SSearch in Google Scholar
 F. Belardo , E. M. LiMarzi , S. K. Simić , Signed line graphs with least eigenvalue −2 : The star complement technique, Discrete Appl. Math. 207 (2016), 29–38. 10.1016/j.dam.2016.02.018Search in Google Scholar
 Z. Stanić , Notes on exceptional signed graphs, Ars Math. Contemp. 18 (2020), 105–115. 10.26493/1855-3974.1933.2dfSearch in Google Scholar
 T. Zaslavsky , Matrices in the theory of signed simple graphs , In B. D. Acharya , G. O. H. Katona , J. Nešetřil , eds. Advances in Discrete Mathematics and Applications: Mysore , 2008, Ramanujan Mathematical Society, Mysore, 2010, pp. 207–229. Search in Google Scholar
 D. Cvetković , P. Rowlinson , S. Simić , An Introduction to the Theory of Graph Spectra, Cambridge University Press, Cambridge, 2010. 10.1017/CBO9780511801518Search in Google Scholar
 G. Greaves , J. Koolen , A. Munemasa , Y. Sano , T. Taniguchi , Edge-signed graphs with smallest eigenvalue greater than −2 , J. Combin. Theory Ser. B 110 (2015), 90–111. 10.1016/j.jctb.2014.07.006Search in Google Scholar
 G. R. Vijayakumar , Signed graphs represented by D∞ , European J. Combin. 8 (1987), 103–112. 10.1016/S0195-6698(87)80024-0Search in Google Scholar
© 2022 Raffaella Mulas and Zoran Stanić, published by De Gruyter
This work is licensed under the Creative Commons Attribution 4.0 International License.