pith. sign in

arxiv: 1907.04349 · v1 · pith:RBGWX7KQnew · submitted 2019-07-09 · 🧮 math.CO · cs.DM

Open problems in the spectral theory of signed graphs

Francesco Belardo , Sebastian M. Cioab\u{a} , Jack H. Koolen , Jianfeng Wang This is my paper

Pith reviewed 2026-05-25 00:12 UTC · model grok-4.3

classification 🧮 math.CO cs.DM MSC 05C5005C22
keywords signed graphsadjacency spectrumspectral graph theorybalanced signed graphsopen problemsgraph matrices
0
0 comments X

The pith

Spectral problems from unsigned graphs extend naturally to signed graphs, where balanced cases recover the original theory.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper surveys general results on adjacency spectra of signed graphs and formulates open problems drawn from the unsigned setting. It establishes that signed graphs provide an elegant generalization, with unsigned graphs appearing precisely as the balanced signed graphs. A reader would care because this move sometimes makes properties visible that remain hidden when restricting to unsigned graphs alone. The survey treats the extension of graph matrices to signed edges as the mechanism that both preserves prior results and generates new questions.

Core claim

By extending the adjacency matrix to signed graphs whose edges carry signs +1 or -1, every spectral question previously studied for unsigned graphs can be restated for signed graphs; the unsigned case reappears exactly when the signed graph is balanced, and the signed version occasionally reveals cleaner or additional structure.

What carries the argument

The adjacency matrix of a signed graph, obtained by replacing each edge with its sign in the usual 0-1 matrix, whose eigenvalues and eigenvectors carry the spectral information.

If this is right

  • Every known result on the spectrum of an unsigned graph immediately yields a corresponding statement for balanced signed graphs.
  • New eigenvalue bounds or characterizations may hold only after signs are allowed, providing stricter information than the unsigned theory supplies.
  • Problems that are difficult or open for unsigned graphs sometimes become solvable or acquire new structure once the signed setting is adopted.
  • The distinction between balanced and unbalanced signed graphs supplies a new partition of the space of all graphs that spectral methods can exploit.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same signed-graph matrix extension could be applied to other linear-algebraic invariants such as the Laplacian or Seidel matrix to obtain parallel generalizations.
  • Signed-graph spectra may furnish a uniform language for studying graphs with edge weights restricted to two values, including certain signed social-network models.
  • Open problems listed in the survey could be tested first on small families of signed graphs with prescribed balance properties to decide which remain genuinely open.

Load-bearing premise

That the natural extension of graph matrices to signed edges keeps the core usefulness of spectral methods while making new phenomena visible that the unsigned case conceals.

What would settle it

A concrete spectral invariant or theorem for unsigned graphs that, when restated for signed graphs, either fails to extend in any natural way or loses every distinguishing feature once the balance condition is imposed.

Figures

Figures reproduced from arXiv: 1907.04349 by Francesco Belardo, Jack H. Koolen, Jianfeng Wang, Sebastian M. Cioab\u{a}.

Figure 1
Figure 1. Figure 1: A sign-symmetric signed graph. 5 [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: The graph A1. Note that the disjoint union of sign-symmetric graphs is again sign-symmetric. Since the above counterexamples involve Seidel matrices which are the same as signed complete graphs, the following is a natural question. Problem 3.3. Are there non-complete connected signed graphs whose spectrum is symmetric with respect to the origin but they are not sign-symmetric? Observe that signed graphs wi… view at source ↗
Figure 3
Figure 3. Figure 3: Maximal cyclotomic signed graphs. In the above category we find the complete graphs with homogeneous signatures (Kn, +) and (Kn, −), the maximal cyclotomic signed graphs T2k, S14 and S16, and that list is not complete (for example, the unbalanced 4-cycle C − 4 and the 3-dimensional cube whose cycles are all negative must be included). There is already some literature on this problem, and we refer the reade… view at source ↗
Figure 4
Figure 4. Figure 4: The cospectral pair (C6, +) and P2 ∪ Q˜4. 14 [PITH_FULL_IMAGE:figures/full_fig_p014_4.png] view at source ↗
read the original abstract

Signed graphs are graphs whose edges get a sign $+1$ or $-1$ (the signature). Signed graphs can be studied by means of graph matrices extended to signed graphs in a natural way. Recently, the spectra of signed graphs have attracted much attention from graph spectra specialists. One motivation is that the spectral theory of signed graphs elegantly generalizes the spectral theories of unsigned graphs. On the other hand, unsigned graphs do not disappear completely, since their role can be taken by the special case of balanced signed graphs. Therefore, spectral problems defined and studied for unsigned graphs can be considered in terms of signed graphs, and sometimes such generalization shows nice properties which cannot be appreciated in terms of (unsigned) graphs. Here, we survey some general results on the adjacency spectra of signed graphs, and we consider some spectral problems which are inspired from the spectral theory of (unsigned) graphs.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript is a survey of established results on the adjacency spectra of signed graphs (graphs with edges signed +1 or -1) and identifies open spectral problems inspired by the spectral theory of unsigned graphs. It motivates the topic by noting that signed-graph spectra generalize unsigned-graph spectra, with unsigned graphs recovered as the special case of balanced signed graphs, and that this generalization can reveal phenomena invisible in the unsigned setting.

Significance. As a literature review that organizes known results and open problems without introducing new mathematical claims, the paper provides a useful reference point for specialists in spectral graph theory. Its value lies in compiling and framing existing work on signed-graph matrices and spectra, which may help direct future research toward the listed open questions. The generalization claim is definitional and standard rather than a novel derivation.

minor comments (2)
  1. The abstract states that 'sometimes such generalization shows nice properties which cannot be appreciated in terms of (unsigned) graphs' but does not name a concrete example; adding one brief illustration in the introduction would improve accessibility for readers new to the area.
  2. Section headings and the list of open problems would benefit from explicit cross-references to the surveyed results that motivate each problem, to make the connection between established theorems and open questions more immediate.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their careful reading and positive recommendation to accept the manuscript. The report accurately characterizes the paper as a survey compiling known results on signed-graph spectra and framing open problems.

Circularity Check

0 steps flagged

No circularity; survey of open problems with no derivations or predictions

full rationale

The paper is explicitly a literature survey and list of open problems in signed-graph spectra. It contains no new derivations, first-principles results, predictions, fitted parameters, or load-bearing theorems. The motivational statement that signed graphs generalize unsigned graphs via balanced signed graphs is presented as definitional background, not as a derived claim. No equations or self-citations function as circular reductions. The paper is self-contained against external benchmarks as a review article.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

This is a survey paper; it introduces no new free parameters, axioms, or invented entities.

pith-pipeline@v0.9.0 · 5686 in / 928 out tokens · 23821 ms · 2026-05-25T00:12:17.196392+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

86 extracted references · 86 canonical work pages · 4 internal anchors

  1. [1]

    Akbari, F

    S. Akbari, F. Belardo, E. Dodongeh and M.A. Nematollahi, Spectral characterizations of signed cycles, Linear Algebra Appl. 553 (2018) 104–116

    work page 2018

  2. [2]

    Proof of a Conjecture on the Seidel Energy of Graphs

    S. Akbari, M. Einollahzadeh, M. M. Karkhaneei and M. A. Ne matollah, Proof of a Conjecture on the Seidel Energy of Graphs, available at https://arxiv.org/abs/1901.06692

    work page internal anchor Pith review Pith/arXiv arXiv 1901

  3. [3]

    Akbari, W.H

    S. Akbari, W.H. Haemers, H.R. Maimani and L.P. Majd, Sign ed graphs cospectral with the path, Linear Algebra Appl. 553 (2018) 104–116

    work page 2018

  4. [4]

    Balla, F

    I. Balla, F. Dr¨ axler, P. Keevash and B. Sudakov, Equiang ular lines and spherical codes in Euclidean space, Invent. Math. 211 (2018) 179-212

    work page 2018

  5. [5]

    Belardo, E.M

    F. Belardo, E.M. Li Marzi and S.K. Simi´ c, Combinatorial approach for computing the char- acteristic polynomial of a matrix, Linear Algebra Appl. 433 (1983) 1513–1523

    work page 1983

  6. [6]

    Belardo, S.K

    F. Belardo, S.K. Simi´ c, On the Laplacian coefficients of s igned graphs, Linear Algebra Appl. 475 (2015), 94–113

    work page 2015

  7. [7]

    Belardo, Z

    F. Belardo, Z. Stani´ c, T. Zaslavsky, Spectra of Total Si gned Graphs, in preparation

    work page

  8. [8]

    Bilu and N

    Y. Bilu and N. Linial, Lifts, discrepancy and nearly opti mal spectral gap, Combinatorica 26 (2006), no. 5, 495–519

    work page 2006

  9. [9]

    W. G. Bridges and R. A. Mena, Multiplicative cones — A fami ly of three eigenvalue graphs, Aequationes Math. 22 (1981) 208–214

    work page 1981

  10. [10]

    Brouwer and W

    A.E. Brouwer and W. Haemers, Spectra of Graphs, Springer Universitext 2012

    work page 2012

  11. [11]

    Brouwer and A

    A.E. Brouwer and A. Neumaier, The graphs with spectral r adius between 2 and √ 2 + √ 5, Linear Algebra Appl. 114/115 (1989) 273–276

    work page 1989

  12. [12]

    Bukh, Bounds on equiangular lines and on related sphe rical codes, SIAM J

    B. Bukh, Bounds on equiangular lines and on related sphe rical codes, SIAM J. Discrete Math. 30 (2015) 549–554

    work page 2015

  13. [13]

    Bussemaker and A

    F. Bussemaker and A. Neumaier, Exceptional graphs with smallest eigenvalue − 2 and related problems, Math. Comp. 59 (200) (1992), 583–608

    work page 1992

  14. [14]

    Butler, Eigenvalues of 2-edge-coverings, Linear Multilinear Algebra 58 (2010), no

    S. Butler, Eigenvalues of 2-edge-coverings, Linear Multilinear Algebra 58 (2010), no. 3-4, 413–423

    work page 2010

  15. [15]

    de Caen, E.R

    D. de Caen, E.R. van Dam and E. Spence, A nonregular analo gue of conference graphs, J. Combin. Theory Ser. A 88 (1999) 194–204

    work page 1999

  16. [16]

    Cameron, J.M

    P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult , Line graphs, root systems and elliptic geometry, J. Algebra 43 (1976) 305–327

    work page 1976

  17. [17]

    Carlson, K

    C. Carlson, K. Chandrasekaran, H.-C. Chang, N. Kakimur a and A. Kolla, Spectral aspects of symmetric matrix signings, prep rint 2017, see https://simons.berkeley.edu/talks/alexandra-kolla-11-7-17

    work page 2017

  18. [18]

    Chawathe and G.R

    P.D. Chawathe and G.R. Vijayakumar, A characterizatio n of signed graphs represented by root system D∞ , Europ. J. Combin. 11 (1990) 523–533. 18

    work page 1990

  19. [19]

    Cioab˘ a, J.H

    S.M. Cioab˘ a, J.H. Koolen, H. Nozaki and J. Vermette, Ma ximizing the order of a regular graph of given valency and second eigenvalue, SIAM J. Discrete Math. 30 (2016) 1509–1525

    work page 2016

  20. [20]

    Cvetkovi´ c, Complexity indices for the traveling salesman problem and data mining, Trans

    D. Cvetkovi´ c, Complexity indices for the traveling salesman problem and data mining, Trans. Comb. 1 (2012) 35–43

    work page 2012

  21. [21]

    Cvetkovi´ c, M

    D. Cvetkovi´ c, M. Doob and I. Gutman, On graphs whose eig envalues do not exceed √ 2 + √ 5, Ars Combin. 14 (1982) 225–239

    work page 1982

  22. [22]

    Cvetkovi´ c, M

    D. Cvetkovi´ c, M. Doob and H. Sachs, Spectra of Graphs - Theory and Applications , 3rd Edition, Johan Ambrosius Bart. Verlag, Heidelberg - Leipzi g, 1995

    work page 1995

  23. [23]

    Cvetkovi´ c and P

    D. Cvetkovi´ c and P. Rowlinson, The largest eigenvalue of a graph: a survey, Linear and Multilinear Algebra 28 (1990), no. 1–2, 3–33

    work page 1990

  24. [24]

    Cvetkovi´ c, P

    D. Cvetkovi´ c, P. Rowlinson and S.K. Simi´ c,An Introduction to the Theory of Graph Spectra , Cambridge University Press, 2010

    work page 2010

  25. [25]

    Cvetkovi´ c, P

    D. Cvetkovi´ c, P. Rowlinson and S.K. Simi´ c, Spectral Generalizations of Line Graphs, On graphs with least eigenvalue − 2, London Mathematical Society Lecture Note Series 314, Cam - bridge University Press, 2004

    work page 2004

  26. [26]

    van Dam, Graphs with Few Eigenvalues

    E.R. van Dam, Graphs with Few Eigenvalues. An Interplay between Combinator ics and Al- gebra, Ph.D. Thesis, Center Dissertation Series 20, Tilburg Univ ersity (1996)

    work page 1996

  27. [27]

    van Dam, Nonregular graphs with three eigenvalues , J

    E.R. van Dam, Nonregular graphs with three eigenvalues , J. Combin. Theory Ser. B 73 (1998) 101–118

    work page 1998

  28. [28]

    van Dam, The combinatorics of Dom de Caen, Des

    E.R. van Dam, The combinatorics of Dom de Caen, Des. Codes Cryptogr. 34 (2005) 137–148

    work page 2005

  29. [29]

    van Dam and J.H

    E.R. van Dam and J.H. Koolen, private communication, Ju ne 2019

    work page 2019

  30. [30]

    van Dam, J.H

    E.R. van Dam, J.H. Koolen and Z.-J. Xia, Zheng-Jiang, Gr aphs with many valencies and few eigenvalues, Electron. J. Linear Algebra 28 (2015), 12–24

    work page 2015

  31. [31]

    Et-Taoui and A

    B. Et-Taoui and A. Fruchard, On switching classes of gra phs, Linear Algebra Appl. 549 (2018) 246–255

    work page 2018

  32. [32]

    Fowler, H¨ uckel spectral of M¨ obiusπ systems, Phys

    P. Fowler, H¨ uckel spectral of M¨ obiusπ systems, Phys. Chem. Chem. Phys. 4 (2002) 2878– 2883

    work page 2002

  33. [33]

    Spectral Theory of Unsigned and Signed Graphs. Applications to Graph Clustering: a Survey

    J. Gallier, Spectral Theory of Unsigned and Signed Grap hs. Applications to Graph Clustering: a Survey, available at https://arxiv.org/abs/1601.04692

    work page internal anchor Pith review Pith/arXiv arXiv

  34. [34]

    Geramita and J

    A.V. Geramita and J. Seberry, Orthogonal designs. Quadratic forms and Hadamard matrices . Lecture Notes in Pure and Applied Mathematics, 45. Marcel Dekker, Inc., New York, 1979. x+460 pp. ISBN: 0-8247-6774-8

    work page 1979

  35. [35]

    Germina, K

    K.A. Germina, K. S. Hameed and T. Zaslavsky, On products and line graphs of signed graphs, their eigenvalues and energy, Linear Algebra Appl. 435 (2011) 2432–2450

    work page 2011

  36. [36]

    Shahul Hameed and K.A

    K. Shahul Hameed and K.A. Germina, On composition of sig ned graphs, Discuss. Math. Graph Theory 32 (2012) 507–516

    work page 2012

  37. [37]

    Ghasemian and G.H

    E. Ghasemian and G.H. Fath-Tabar, On signed graphs with two distinct eigenvalues, Filomat 31 (2017) 6393–6400. 19

    work page 2017

  38. [38]

    Ghorbani, On eigenvalues of Seidel matrices and Haem ers’ conjecture, Des

    E. Ghorbani, On eigenvalues of Seidel matrices and Haem ers’ conjecture, Des. Codes Cryp- togr. 84 (2017), no. 1–2, 189–195

    work page 2017

  39. [39]

    Glazyrin and W.-H

    A. Glazyrin and W.-H. Yu, Upper bounds for s-distance sets and equiangular lines, Adv. Math. 330 (2018) 810–833

    work page 2018

  40. [40]

    Godsil, Algebraic Combinatorics Chapman and Hall Math

    C. Godsil, Algebraic Combinatorics Chapman and Hall Math. Series, Chapman & Hall, New York, 1993

    work page 1993

  41. [41]

    Godsil and I

    C. Godsil and I. Gutman, On the matching polynomial of a g raph, in Algebraic Methods in Graph Theory, Vol. I, II (Szeged, 1978), Colloq. Math. Soc. J´ ano s Bolyai 25, North-Holland, New York, 1981, pp. 241–249

    work page 1978

  42. [42]

    Godsil and G

    C. Godsil and G. Royle, Algebraic Graph Theory , Springer Graduate Texts Mathematics (2001)

    work page 2001

  43. [43]

    Goethals and J

    J.-M. Goethals and J. J. Seidel, The regular two-graph o n 276 vertices, Disc. Math. 12 (1975) 143–158

    work page 1975

  44. [44]

    Greaves, Equiangular line systems and switching cla sses containing regular graphs, Linear Algebra Appl

    G. Greaves, Equiangular line systems and switching cla sses containing regular graphs, Linear Algebra Appl. 536 (2018) 31–51

    work page 2018

  45. [45]

    Greaves, J.H

    G. Greaves, J.H. Koolen, A. Munemasa and F. Sz¨ oll˝ osi,Equiangular lines in Euclidean spaces, J. Combin. Theory Ser. A 138 (2016), 208–235

    work page 2016

  46. [46]

    D.A. Gregory, Spectra of signed adjacency matrices, Queen ’s - RMC Discrete Mathematics Seminar , February 27, 2012, available at https://pdfs.semanticscholar.org/eb2e/078a4a4d8dcfeed9e86417e17ecbb91696e0.pdf

    work page 2012

  47. [47]

    Haemers, Private communication to the 2nd author, April 2011

    W.H. Haemers, Private communication to the 2nd author, April 2011

    work page 2011

  48. [48]

    Haemers, Seidel switching and graph energy, MATCH Commun

    W.H. Haemers, Seidel switching and graph energy, MATCH Commun. Math. Comput. Chem. 68 (2012), no. 3, 653–659

    work page 2012

  49. [49]

    Heilmann and E.H

    O.J. Heilmann and E.H. Lieb, Theory of monomer-dimer sy stems, Comm. Math. Phys. 25 (1972) 190-232

    work page 1972

  50. [50]

    Hoffman, On limit points of spectral radii of non-neg ative symmetric integral matrices, Graph Theory Appl., Lect

    A.J. Hoffman, On limit points of spectral radii of non-neg ative symmetric integral matrices, Graph Theory Appl., Lect. Notes Math. 303 (1972) 165–172

    work page 1972

  51. [51]

    Hoffman, On graphs whose least eigenvalue exceeds − 1 − √ 2, Linear Algebra Appl

    A.J. Hoffman, On graphs whose least eigenvalue exceeds − 1 − √ 2, Linear Algebra Appl. 16 (1977), 153–165

    work page 1977

  52. [52]

    Hoffman and J.H

    A.J. Hoffman and J.H. Smith, On the spectral radii of topol ogically equivalent graphs, M. Fiedler (Ed.), Recent Advances in Graph theory, Academia Praha, Prague, 1975, pp. 273–281

    work page 1975

  53. [53]

    Hoory, N

    S. Hoory, N. Linial and A. Wigderson, Expander graphs an d their applications, Bull. Amer. Math. Soc. (N.S.) 43 (2006), no. 4, 439–561

    work page 2006

  54. [54]

    Huang, Induced graphs of the hypercube and a proof of t he Sensitivity Conjecture, avail- able at https://arxiv.org/abs/1907.00847v1

    H. Huang, Induced graphs of the hypercube and a proof of t he Sensitivity Conjecture, avail- able at https://arxiv.org/abs/1907.00847v1

    work page arXiv 1907

  55. [55]

    Inoue, A construction of the McLaughlin graph from th e Hoffman-Singleton graph, Aus- tralas

    K. Inoue, A construction of the McLaughlin graph from th e Hoffman-Singleton graph, Aus- tralas. J. Combin. 52 (2012) 197–204. 20

    work page 2012

  56. [56]

    Jiang and A

    Z. Jiang and A. Polyanskii, Forbidden subgraphs for gra phs of bound spectral ra- dius, with applications to equiangular lines, Israel J. Math. accepted, available at https://arxiv.org/abs/1708.02317

    work page arXiv

  57. [57]

    Koolen and A

    J.H. Koolen and A. Munemasa, personal communication 20 19

    work page

  58. [58]

    Koolen and Q

    J.H. Koolen and Q. Yang, Problems on graphs with smalles t fixed eigenvalue, Algebra Colloq., to appear

    work page

  59. [59]

    Koolen, J.Y

    J.H. Koolen, J.Y. Yang and Q. Yang, On graphs with smalle st eigenvalue at least − 3 and their lattices, Adv. Math 338 (2018), 847–864

    work page 2018

  60. [60]

    Lemmens and J.J

    P.W.H. Lemmens and J.J. Seidel, Equiangular lines, J. Algebra 24 (1973), 494–512

    work page 1973

  61. [61]

    Lin and W.-H

    Y.R. Lin and W.-H. Yu, Equiangular lines and the Lemmens -Seidel conjecture, available at https://arxiv.org/abs/1807.06249

    work page arXiv

  62. [62]

    van Lint and J.J

    J. van Lint and J.J. Seidel, Equilateral point sets in el liptic geometry, Indagationes Mathe- maticae 28 (1966) 335–348

    work page 1966

  63. [63]

    van Lint and R.M

    J. van Lint and R.M. Wilson, A Course in Combinatorics , 2nd edn. Cambridge University Press, Cambridge(2001)

    work page 2001

  64. [64]

    Mallows and N.J.A

    C.L. Mallows and N.J.A. Sloane, Two-graphs, switching classes and Euler graphs are equal in number, SIAM J. Appl. Math. 28 (1975) 876–880

    work page 1975

  65. [65]

    Marcus, D

    A. Marcus, D. Spielman and N. Srivastava, Interlacing f amilies I: Bipartite Ramanujan graphs of all degrees, Ann. of Math. (2) 182 (2015), no. 1, 307–325

    work page 2015

  66. [66]

    McKee and C

    J. McKee and C. Smyth, Integer symmetric matrices havin g all their eigenvalues in the interval [–2, 2], J. Algebra 317 (2007) 260–290

    work page 2007

  67. [67]

    Muzychuk and M

    M. Muzychuk and M. Klin, On graphs with three eigenvalue s, Discrete Math. 189 (1998) 191–207

    work page 1998

  68. [68]

    Neumaier, Graph representations, two-distance set s, and equiangular lines, Linear Algebra Appl

    A. Neumaier, Graph representations, two-distance set s, and equiangular lines, Linear Algebra Appl. 114-115 (1986) 141–156

    work page 1986

  69. [69]

    Nilli, On the second eigenvalue of a graph, Discrete Math

    A. Nilli, On the second eigenvalue of a graph, Discrete Math. 91 (1991) 207–210

    work page 1991

  70. [70]

    Nikiforov, Some inequalities for the largest eigenv alue of a graph, Combin

    V. Nikiforov, Some inequalities for the largest eigenv alue of a graph, Combin. Prob. Comput. 11 (2001) 179–189

    work page 2001

  71. [71]

    On the signed graphs with two distinct eigenvalues

    F. Ramezani, On the signed graphs with two distinct eige nvalues, preprint available at arXiv:1511.03511

    work page internal anchor Pith review Pith/arXiv arXiv

  72. [72]

    Determinants of Seidel matrices and a conjecture of Ghorbani

    D. Rizzolo, Seidel matrices and a conjecture of Ghorban i, preprint available at https://arxiv.org/abs/1904.04870

    work page internal anchor Pith review Pith/arXiv arXiv 1904

  73. [73]

    Seidel, A survey of two-graphs

    J.J. Seidel, A survey of two-graphs. In: Colloquio Inte rnazionale sulle Teorie Combinatorie (Proceedings, Rome, 1973), vol. I, pp. 481–511. Atti dei Con vegni Lincei, No. 17. Accademia Nazionale dei Lincei, Rome

    work page 1973

  74. [74]

    J. J. Seidel and S. V. Tsaranov, Two-graphs, related gro ups, and root systems, Bull. Soc. Math. Belgique 42 (1990) 695–711. 21

    work page 1990

  75. [75]

    Shearer, On the distribution of the maximum eigenval ue of graphs, Linear Algebra Appl

    J. Shearer, On the distribution of the maximum eigenval ue of graphs, Linear Algebra Appl. 114/115 (1989) 17–20

    work page 1989

  76. [76]

    Stevanovi´ c,Spectral radius of graphs , Academic Press Elsevier 2015

    D. Stevanovi´ c,Spectral radius of graphs , Academic Press Elsevier 2015

    work page 2015

  77. [77]

    Sz¨ oll˝ osi and P.R.J.¨Osterg ˚ ard, Enumeration of Seidel matrices,European J

    F. Sz¨ oll˝ osi and P.R.J.¨Osterg ˚ ard, Enumeration of Seidel matrices,European J. Combin. 69 (2018), 169–184

    work page 2018

  78. [78]

    Vijayakumar, Signed graphs represented by D∞ , European J

    G.R. Vijayakumar, Signed graphs represented by D∞ , European J. Combin. 8 (1987), 103– 112

    work page 1987

  79. [79]

    Y. Wang, D. Chakrabarti, C. Wang and C. Faloutsos, Epide mic spreading in networks: An eigenvalue viewpoint, 22nd Symposium in Reliable Distributed Computing, Florence , Italy Oct. 6-8, 2003

    work page 2003

  80. [80]

    Woo and A

    R. Woo and A. Neumaier, On graphs whose smallest eigenva lue is at least − 1 − √ 2, Linear Algebra Appl. 226 (228) (1995), 577–591

    work page 1995

Showing first 80 references.