On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)

DOI10.1016/0024-3795(77)90027-1zbMath0354.05048OpenAlexW2053564233MaRDI QIDQ1236551

Alan J. Hoffman

Publication date: 1977

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(77)90027-1

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph theory (05C99)

Related Items (34)

A structure theory for graphs with fixed smallest eigenvalue ⋮ On the efficiency of regular generalized line graph designs ⋮ Total graph of a signed graph ⋮ Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \) ⋮ On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\) ⋮ Polyhedral characterizations and perfection of line graphs ⋮ Signed analogue of line graphs and their smallest eigenvalues ⋮ Fat Hoffman graphs with smallest eigenvalue greater than \(-3\) ⋮ Exceptional graphs with smallest eigenvalue -2 and related problems ⋮ On the least eigenvalue of cacti with pendant vertices ⋮ On the limit points of the smallest eigenvalues of regular graphs ⋮ A generalization of a theorem of Hoffman ⋮ Edge-signed graphs with smallest eigenvalue greater than \(-2\) ⋮ On the order of regular graphs with fixed second largest eigenvalue ⋮ Equivalence of four descriptions of generalized line graphs ⋮ The symbiotic relationship of combinatorics and matrix theory ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\) ⋮ On least eigenvalues of bicyclic graphs with fixed number of pendant vertices ⋮ The distance-regular graphs such that all of its second largest local eigenvalues are at most one ⋮ Line graphs, root systems, and elliptic geometry ⋮ Open problems in the spectral theory of signed graphs ⋮ On graphs with smallest eigenvalue at least \(-3\) and their lattices ⋮ On the integrability of strongly regular graphs ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey ⋮ Some observations on the smallest adjacency eigenvalue of a graph ⋮ On graphs with the smallest eigenvalue at least −1 − √2, part III ⋮ A characterization of signed graphs represented by root system \(D_ \infty\) ⋮ On spectral characterization and embeddings of graphs ⋮ Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\) ⋮ On graphs with three eigenvalues ⋮ Regular character-graphs whose eigenvalues are greater than or equal to \(-2\) ⋮ From finite line graphs to infinite derived signed graphs ⋮ Uniquely derived generalized line graphs and uniquely represented signed graphs with least eigenvalues \(\geq -2\)

Cites Work

• Orbits under actions of affine groups over GF(2)
• Line graphs, root systems, and elliptic geometry
• On eigenvalues of symmetric (+1,-1) matrices
• The interchange graph of a finite graph
• The Change in the Least Eigenvalued of the Adjacency Matrix of a Graph Under Imbedding
• Unnamed Item
• Unnamed Item

This page was built for publication: On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)