Edge-signed graphs with smallest eigenvalue greater than \(-2\)

DOI10.1016/j.jctb.2014.07.006zbMath1302.05074arXiv1309.5178OpenAlexW1972386726MaRDI QIDQ473101

Yoshio Sano, Tetsuji Taniguchi, Akihiro Munemasa, Jack H. Koolen, Gary R. W. Greaves

Publication date: 21 November 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.5178

zbMATH Keywords

smallest eigenvalueline graphssigned graphsHoffman conjectureHoffman graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76)

Related Items (19)

Unit gain graphs with two distinct eigenvalues and systems of lines in complex space ⋮ Star complements for \(\pm 2\) in signed graphs ⋮ Signed line graphs with least eigenvalue -2: the star complement technique ⋮ Some relations between the skew spectrum of an oriented graph and the spectrum of certain closely associated signed graphs ⋮ Signed analogue of line graphs and their smallest eigenvalues ⋮ Polynomial reconstruction of signed graphs whose least eigenvalue is close to -2 ⋮ Linear ternary codes of strongly regular signed graphs ⋮ On signed graphs whose spectral radius does not exceed \(\sqrt{2 + \sqrt{5}}\) ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ Signed graphs with totally disconnected star complements ⋮ An application of Hoffman graphs for spectral characterizations of graphs ⋮ Baskets and fibred links realizing \(A_n\) ⋮ On signed graphs whose second largest Laplacian eigenvalue does not exceed 3 ⋮ On signed graphs with just two distinct Laplacian eigenvalues ⋮ Spectra of signed graphs with two eigenvalues ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey ⋮ Notes on exceptional signed graphs ⋮ A decomposition of signed graphs with two eigenvalues ⋮ Signed graphs whose spectrum is bounded by \(- 2\)

Cites Work

• Fat Hoffman graphs with smallest eigenvalue greater than \(-3\)
• Spectra of graphs
• On spectral characterization and embeddings of graphs
• Signed graphs represented by \(D_{\infty}\)
• Line graphs, root systems, and elliptic geometry
• On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
• On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
• On the KNS conjecture in type \(E\)
• Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2\)]
• An interrelation between line graphs, eigenvalues, and matroids
• On fat Hoffman graphs with smallest eigenvalue at least -3
• Fat Hoffman graphs with smallest eigenvalue at least −1 − τ
• Matrix Analysis
• Exceptional graphs with smallest eigenvalue -2 and related problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge-signed graphs with smallest eigenvalue greater than \(-2\)