Edge-signed graphs with smallest eigenvalue greater than -2
From MaRDI portal
Publication:473101
DOI10.1016/J.JCTB.2014.07.006zbMATH Open1302.05074arXiv1309.5178OpenAlexW1972386726MaRDI QIDQ473101FDOQ473101
Authors: Jack H. Koolen, Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi, Gary R. W. Greaves 
Publication date: 21 November 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Abstract: We give a structural classification of edge-signed graphs with smallest eigenvalue greater than -2. We prove a conjecture of Hoffman about the smallest eigenvalue of the line graph of a tree that was stated in the 1970s. Furthermore, we prove a more general result extending Hoffman's original statement to all edge-signed graphs with smallest eigenvalue greater than -2. Our results give a classification of the special graphs of fat Hoffman graphs with smallest eigenvalue greater than -3.
Full work available at URL: https://arxiv.org/abs/1309.5178
Recommendations
- Signed graphs with least eigenvalue \(<-2\)
- scientific article; zbMATH DE number 6004041
- On signed graphs with at most two eigenvalues unequal to \(\pm 1\)
- Publication:3495382
- Signed graphs with extremal least Laplacian eigenvalue
- Signed graphs with all but two eigenvalues equal to \(\pm 1\)
- On signed graphs with just two distinct adjacency eigenvalues
- On signed graphs with two distinct eigenvalues
- On the signed graphs with two distinct eigenvalues
- The signed graphs with all but at most three eigenvalues equal to \(-1\)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Matrix Analysis
- Spectra of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
- On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
- On fat Hoffman graphs with smallest eigenvalue at least -3
- An interrelation between line graphs, eigenvalues, and matroids
- On spectral characterization and embeddings of graphs
- Line graphs, root systems, and elliptic geometry
- Fat Hoffman graphs with smallest eigenvalue at least \(-1 - \tau\)
- Title not available (Why is that?)
- Fat Hoffman graphs with smallest eigenvalue greater than \(-3\)
- Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2]\)
- Exceptional graphs with smallest eigenvalue -2 and related problems
- Signed graphs represented by \(D_{\infty}\)
- On the KNS conjecture in type \(E\)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (26)
- Signed graphs whose spectrum is bounded by \(- 2\)
- Some relations between the skew spectrum of an oriented graph and the spectrum of certain closely associated signed graphs
- Baskets and fibred links realizing \(A_n\)
- On signed graphs whose second largest Laplacian eigenvalue does not exceed 3
- Signed line graphs with least eigenvalue -2: the star complement technique
- On fat Hoffman graphs with smallest eigenvalue at least \(-3\). II
- Fat Hoffman graphs with smallest eigenvalue at least \(-1 - \tau\)
- Star complements for \(\pm 2\) in signed graphs
- On graphs with the smallest eigenvalue at least \(-1 - \sqrt{2} \). III
- Signed zero-divisor graphs over commutative rings
- Polynomial reconstruction of signed graphs whose least eigenvalue is close to \(-2\)
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
- Title not available (Why is that?)
- Linear ternary codes of strongly regular signed graphs
- Notes on exceptional signed graphs
- On graphs with the smallest eigenvalue at least −1 − √2, part I
- On signed graphs whose spectral radius does not exceed \(\sqrt{2 + \sqrt{5}}\)
- A decomposition of signed graphs with two eigenvalues
- Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
- Graphs with least eigenvalue \(-2\): ten years on
- Signed graphs with least eigenvalue \(<-2\)
- Signed analogue of line graphs and their smallest eigenvalues
- Signed graphs with totally disconnected star complements
- An application of Hoffman graphs for spectral characterizations of graphs
- Spectra of signed graphs with two eigenvalues
- On signed graphs with just two distinct Laplacian eigenvalues
This page was built for publication: Edge-signed graphs with smallest eigenvalue greater than \(-2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473101)
