Small regular graphs with four eigenvalues
From MaRDI portal
Publication:1584360
DOI10.1016/S0012-365X(98)00085-5zbMath0956.05070OpenAlexW2096039962MaRDI QIDQ1584360
Spence, Edward, van Dam, Edwin R.
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00085-5
Association schemes, strongly regular graphs (05E30) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (44)
A spectral characterization of the \(s\)-clique extension of the square grid graphs ⋮ Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) ⋮ Integral circulant graphs with four distinct eigenvalues ⋮ On regular graphs with four distinct eigenvalues ⋮ Combinatorial designs with two singular values. I: Uniform multiplicative designs ⋮ Graphs with few matching roots ⋮ On 2-equitable graphs ⋮ Signed graphs with two eigenvalues and vertex degree five ⋮ Bounds on special subsets in graphs, eigenvalues and association schemes ⋮ Enumeration of Seidel matrices ⋮ Equiangular lines in Euclidean spaces ⋮ Real equiangular lines in dimension 18 and the Jacobi identity for complementary subgraphs ⋮ 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 ⋮ Characterisation of all integral circulant graphs with multiplicative divisor sets and few eigenvalues ⋮ Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\) ⋮ On split graphs with three or four distinct (normalized) Laplacian eigenvalues ⋮ Divisible design graphs ⋮ Which graphs are determined by their spectrum? ⋮ Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation ⋮ Some graphs whose second largest eigenvalue does not exceed \(\sqrt 2\) ⋮ Graphs with four distinct Laplacian eigenvalues ⋮ Graphs whose certain polynomials have few distinct roots ⋮ The local structure of a bipartite distance-regular graph ⋮ On graphs with three distinct Laplacian eigenvalues ⋮ Q-integral graphs with edge-degrees at most five ⋮ Two characterizations of the grid graphs ⋮ A note on graphs whose signless Laplacian has three distinct eigenvalues ⋮ Graphs (networks) with golden spectral ratio ⋮ Combinatorial designs with two singular values. II: Partial geometric designs ⋮ Universal adjacency matrices with two eigenvalues ⋮ Graphs whose normalized Laplacian has three eigenvalues ⋮ Two spectral characterizations of regular, bipartite graphs with five eigenvalues ⋮ Unnamed Item ⋮ Graphs with few distinct eigenvalues and extremal energy ⋮ On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity ⋮ On the spectrum of an extremal graph with four eigenvalues ⋮ A nonregular analogue of conference graphs ⋮ Graphs with three distinct eigenvalues and largest eigenvalue less than 8 ⋮ Monotonic normalized heat diffusion for regular bipartite graphs with four eigenvalues ⋮ Three-class association schemes ⋮ The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5 ⋮ Spectral Proofs of Maximality of Some Seidel Matrices
Cites Work
- Pseudocyclic 3-class association schemes on 28 points
- Feasibility conditions for the existence of walk-regular graphs
- Three-class association schemes
- Regular graphs with four eigenvalues
- Regular two-graphs on 36 vertices
- Graphs cospectral with distance-regular graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Small regular graphs with four eigenvalues
