On characterizing certain graphs with four eigenvalues by their spectra

DOI10.1016/0024-3795(70)90037-6zbMath0202.55703OpenAlexW2030683030MaRDI QIDQ2541352

Michael Doob

Publication date: 1970

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

Full work available at URL: https://doi.org/10.1016/0024-3795(70)90037-6

Related Items

Eigenvalues of the Laplacian of a graph^∗ ⋮ Regular graphs with four eigenvalues ⋮ The \(T\)-shape tree is determined by its Laplacian spectrum ⋮ Laplacian spectra and spanning trees of threshold graphs ⋮ Graphs with few matching roots ⋮ On the automorphism groups of rank-4 primitive coherent configurations ⋮ Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues ⋮ On split graphs with three or four distinct (normalized) Laplacian eigenvalues ⋮ Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation ⋮ A surprising property of the least eigenvalue of a graph ⋮ Line graphs, root systems, and elliptic geometry ⋮ On split graphs with four distinct eigenvalues ⋮ An interrelation between line graphs, eigenvalues, and matroids ⋮ Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs ⋮ Lower bounds on the spectra of symmetric matrices with nonnegative entries

Cites Work

• Unnamed Item
• Unnamed Item
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• On the Polynomial of a Graph
• On the Line Graph of the Complete Bipartite Graph
• On the line Graph of a Finite Affine Plane
• On the Line Graph of a Projective Plane
• On the Line-Graph of the Complete Bigraph
• On the Line Graph of a Symmetric Balanced Incomplete Block Design

This page was built for publication: On characterizing certain graphs with four eigenvalues by their spectra