Biregular graphs with three eigenvalues

DOI10.1016/j.ejc.2016.03.004zbMath1335.05107arXiv1412.6971OpenAlexW342075362MaRDI QIDQ281935

Alexander L. Gavrilyuk, Xi-ming Cheng, Gary R. W. Greaves, Jack H. Koolen

Publication date: 11 May 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.6971

zbMATH Keywords

structure theoremsvalency constraints

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (26)

More on graphs with just three distinct eigenvalues ⋮ A generalization of a theorem of Neumaier ⋮ Hypercubes are determined by their distance spectra ⋮ On graphs with just three distinct eigenvalues ⋮ Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) ⋮ On the multiplicity of the least signless Laplacian eigenvalue of a graph ⋮ On regular graphs with four distinct eigenvalues ⋮ More on signed graphs with at most three eigenvalues ⋮ Signed graphs with at most three eigenvalues ⋮ On graphs with three distinct signless Laplacian eigenvalues ⋮ On 2-equitable graphs ⋮ 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 ⋮ Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\) ⋮ On split graphs with three or four distinct (normalized) Laplacian eigenvalues ⋮ Unnamed Item ⋮ A problem concerning graphs with just three distinct eigenvalues ⋮ Graphs with three eigenvalues and second largest eigenvalue at most 1 ⋮ On signed graphs with just two distinct Laplacian eigenvalues ⋮ Unnamed Item ⋮ Signed graphs with three eigenvalues: biregularity and beyond ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey ⋮ Some new aspects of main eigenvalues of graphs ⋮ On signed graphs with just two distinct adjacency eigenvalues ⋮ The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5

Uses Software

• Magma
• nauty
• Traces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The minimal spectral radius of graphs with a given diameter
• Graphs with three distinct eigenvalues and largest eigenvalue less than 8
• Multiplicative cones - a family of three eigenvalue graphs
• Affine resolvable balanced incomplete block designs: a survey
• Symmetric group divisible designs with the dual property
• Strongly regular graphs with smallest eigenvalue -m
• Nonregular graphs with three eigenvalues
• Classification of affine resolvable \(2\)-\((27,9,4)\) designs
• The Magma algebra system. I: The user language
• On graphs with three eigenvalues
• The combinatorics of Dom de Caen
• A nonregular analogue of conference graphs
• Practical graph isomorphism. II.
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
• Graphs with many valencies and few eigenvalues
• The search for pseudo orthogonal Latin squares of order six

This page was built for publication: Biregular graphs with three eigenvalues