A problem concerning graphs with just three distinct eigenvalues
From MaRDI portal
Publication:1987019
Recommendations
- On graphs with just three distinct eigenvalues
- More on graphs with just three distinct eigenvalues
- On graphs with three eigenvalues
- Graphs with three distinct -eigenvalues
- On graphs with three distinct Laplacian eigenvalues
- Some graphs with exactly three non-negative eigenvalues
- Graphs with three distinct distance eigenvalues
- Graphs with three distinct eigenvalues and largest eigenvalue less than 8
- scientific article; zbMATH DE number 4041958
- Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
Cites work
- An example of using star complements in classifying strongly regular graphs
- An introduction to the theory of graph spectra
- Biregular graphs with three eigenvalues
- Graphs with least eigenvalue -2: ten years on
- Graphs with three eigenvalues and second largest eigenvalue at most 1
- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- scientific article; zbMATH DE number 2117218 (Why is no real title available?)
- More on graphs with just three distinct eigenvalues
- On graphs with just three distinct eigenvalues
- ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
- Strongly regular graphs with strongly regular decomposition
- The main eigenvalues of a graph: a survey
This page was built for publication: A problem concerning graphs with just three distinct eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1987019)