Abstract: We consider nonregular graphs having precisely three distinct eigenvalues. The focus is mainly on the case of graphs having two distinct valencies and our results include constructions of new examples, structure theorems, valency constraints, and a classification of certain special families of such graphs. We also present a new example of a graph with three valencies and three eigenvalues of which there are currently only finitely many known examples.
Recommendations
- Regular bipartite graphs with three distinct non-negative eigenvalues
- Nonregular graphs with three eigenvalues
- On graphs with three eigenvalues
- Signed graphs with three eigenvalues: biregularity and beyond
- On regular signed graphs with three eigenvalues
- On graphs with just three distinct eigenvalues
- On graphs with three distinct Laplacian eigenvalues
- Graphs with three distinct -eigenvalues
- Graphs whose normalized Laplacian has three eigenvalues
- Some graphs with exactly three non-negative eigenvalues
Cites work
- A nonregular analogue of conference graphs
- Affine resolvable balanced incomplete block designs: a survey
- Classification of affine resolvable 2-(27,9,4) designs
- Eigenspaces of graphs
- Graphs with many valencies and few eigenvalues
- Graphs with three distinct eigenvalues and largest eigenvalue less than 8
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3668628 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3394189 (Why is no real title available?)
- Multiplicative cones - a family of three eigenvalue graphs
- Nonregular graphs with three eigenvalues
- On graphs with three eigenvalues
- ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
- Practical graph isomorphism. II.
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- Strongly regular graphs with smallest eigenvalue -m
- Symmetric group divisible designs with the dual property
- The combinatorics of Dom de Caen
- The Magma algebra system. I: The user language
- The minimal spectral radius of graphs with a given diameter
- The search for pseudo orthogonal Latin squares of order six
Cited in
(33)- On graphs with three eigenvalues
- Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
- Regular bipartite graphs with three distinct non-negative eigenvalues
- A problem concerning graphs with just three distinct eigenvalues
- On signed graphs with just two distinct Laplacian eigenvalues
- Signed graphs with three eigenvalues: biregularity and beyond
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
- On the multiplicity of the least signless Laplacian eigenvalue of a graph
- More on signed graphs with at most three eigenvalues
- Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)
- Some new aspects of main eigenvalues of graphs
- On signed graphs with just two distinct adjacency eigenvalues
- A generalization of a theorem of Neumaier
- Hypercubes are determined by their distance spectra
- On graphs with just three distinct eigenvalues
- On regular graphs with four distinct eigenvalues
- More on graphs with just three distinct eigenvalues
- Signed graphs with at most three eigenvalues
- On graphs with three distinct signless Laplacian eigenvalues
- Unicyclic graphs with five Laplacian eigenvalues different from 0 and 1
- On 2-equitable graphs
- Graphs with many valencies and few eigenvalues
- The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5
- Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\)
- Graphs with two main and two plain eigenvalues
- 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
- Planar graphs whose second largest eigenvalue smaller than \(\frac{\sqrt{5}-1}{2}\)
- The \(T_{1,2}\)-free planar graphs whose second largest eigenvalue does not exceed 1
- Further studies on chromatic completion of graphs
- Graphs with three eigenvalues and second largest eigenvalue at most 1
- Connected triangle-free planar graphs whose second largest eigenvalue is at most 1
- On K₄-minor free graphs whose second largest eigenvalue does not exceed 1
This page was built for publication: Biregular graphs with three eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281935)
