On graphs with smallest eigenvalue at least -3 and their lattices

DOI10.1016/J.AIM.2018.09.004zbMATH Open1396.05071arXiv1804.00369OpenAlexW2962790903MaRDI QIDQ1789501FDOQ1789501

Authors: Jack H. Koolen, Jae Young Yang, Qianqian Yang 

Publication date: 10 October 2018

Published in: Advances in Mathematics (Search for Journal in Brave)

Abstract: In this paper, we show that a connected graph with smallest eigenvalue at least -3 and large enough minimal degree is 2-integrable. This result generalizes a 1977 result of Hoffman for connected graphs with smallest eigenvalue at least -2.

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

Recommendations

• On the integrability of strongly regular graphs
• On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
• On graphs with the smallest eigenvalue at least \(-1 - \sqrt 2\). II
• A generalization of a theorem of Hoffman
• On graphs whose least eigenvalue is greater than –2

zbMATH Keywords

latticeeigenvalueHoffman graphroot lattice\(s\)-integrability

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Geometry of numbers (11H99)

Cites Work

• Title not available (Why is that?)
• Spectra of graphs
• Title not available (Why is that?)
• Near \(n\)-gons and line systems
• On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
• On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
• A structure theory for graphs with fixed smallest eigenvalue
• On fat Hoffman graphs with smallest eigenvalue at least -3
• Tight 2-designs and perfect 1-codes in Doob graphs
• Title not available (Why is that?)
• Low-dimensional lattices V. Integral coordinates for integral lattices
• Line graphs, root systems, and elliptic geometry
• Signed graphs represented by \(D_{\infty}\)
• The regular two-graph on 276 vertices
• On the integrability of strongly regular graphs
• Odd unimodular lattices of minimum~4

Cited In (16)

• Fat Hoffman graphs with smallest eigenvalue greater than \(-3\)
• Open problems in the spectral theory of signed graphs
• A generalization of a theorem of Hoffman
• On the integrability of strongly regular graphs
• A spectral characterization of the \(s\)-clique extension of the square grid graphs
• Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \)
• Characterizing signed mixed graphs with small eigenvalues
• Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
• Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\)
• Bounds of eigenvalues of \(K_{3,3}\)-minor free graphs
• Strongly regular graphs with Hoffman's condition
• Sesqui-regular graphs with fixed smallest eigenvalue
• Spectral properties of the eccentricity matrix of graphs
• Signed analogue of line graphs and their smallest eigenvalues
• On fat Hoffman graphs with smallest eigenvalue at least -3
• Spectral characterization of the complete graph removing a cycle

This page was built for publication: On graphs with smallest eigenvalue at least \(-3\) and their lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1789501)