GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES
From MaRDI portal
Publication:5650416
DOI10.1111/j.1749-6632.1970.tb56460.xzbMath0241.05112OpenAlexW2010093417MaRDI QIDQ5650416
Publication date: 1970
Published in: Annals of the New York Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1749-6632.1970.tb56460.x
Related Items (25)
On the multiplicity of the least signless Laplacian eigenvalue of a graph ⋮ Regular graphs with four eigenvalues ⋮ On regular graphs with four distinct eigenvalues ⋮ On graphs with three distinct signless Laplacian eigenvalues ⋮ Graphs with few matching roots ⋮ On the multiplicity of Laplacian eigenvalues for unicyclic graphs ⋮ On 2-equitable graphs ⋮ Spectra of quasi-strongly regular graphs ⋮ Characterization of digraphs with three complementarity eigenvalues ⋮ Multiplicative designs II. Uniform normal and related structures ⋮ Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\) ⋮ Graphs with two main and two plain eigenvalues ⋮ Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\) ⋮ Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation ⋮ Upper and lower bounds for the energy of bipartite graphs. ⋮ Spectra of strongly Deza graphs ⋮ Characterization of graphs with an eigenvalue of large multiplicity ⋮ Lower bounds for the energy of digraphs ⋮ Unnamed Item ⋮ Spectral characterization of some graphs ⋮ Graphs with few distinct eigenvalues and extremal energy ⋮ Special partially balanced incomplete block designs and associated graphs ⋮ Nonregular graphs with three eigenvalues ⋮ On the eigenvalues of trees ⋮ The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5
This page was built for publication: GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES
