Small regular graphs with four eigenvalues
From MaRDI portal
Publication:1584360
Cites work
- Feasibility conditions for the existence of walk-regular graphs
- Graphs cospectral with distance-regular graphs
- scientific article; zbMATH DE number 17112 (Why is no real title available?)
- scientific article; zbMATH DE number 11983 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3510326 (Why is no real title available?)
- scientific article; zbMATH DE number 3528270 (Why is no real title available?)
- scientific article; zbMATH DE number 3547309 (Why is no real title available?)
- Pseudocyclic 3-class association schemes on 28 points
- Regular graphs with four eigenvalues
- Regular two-graphs on 36 vertices
- Three-class association schemes
Cited in
(47)- Graphs with three distinct eigenvalues and largest eigenvalue less than 8
- Three-class association schemes
- Bounds on special subsets in graphs, eigenvalues and association schemes
- Which graphs are determined by their spectrum?
- 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\)
- Enumeration of Seidel matrices
- Combinatorial designs with two singular values. II: Partial geometric designs
- A nonregular analogue of conference graphs
- The local structure of a bipartite distance-regular graph
- Two characterizations of the grid graphs
- Graphs with few distinct eigenvalues and extremal energy
- Monotonic normalized heat diffusion for regular bipartite graphs with four eigenvalues
- Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)
- Divisible design graphs
- Graphs (networks) with golden spectral ratio
- On the spectrum of an extremal graph with four eigenvalues
- A note on graphs whose signless Laplacian has three distinct eigenvalues
- On regular graphs with four distinct eigenvalues
- Graphs with few matching roots
- Some graphs whose second largest eigenvalue does not exceed \(\sqrt 2\)
- Integral circulant graphs with four distinct eigenvalues
- Finding planted subgraphs with few eigenvalues using the Schur-Horn relaxation
- On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity
- Graphs whose certain polynomials have few distinct roots
- Unicyclic graphs with five Laplacian eigenvalues different from 0 and 1
- On 2-equitable graphs
- Signed graphs with two eigenvalues and vertex degree five
- Universal adjacency matrices with two eigenvalues
- Graphs whose normalized Laplacian has three eigenvalues
- Two spectral characterizations of regular, bipartite graphs with five eigenvalues
- The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5
- Spectral proofs of maximality of some Seidel matrices
- Combinatorial designs with two singular values. I: Uniform multiplicative designs
- 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
- On split graphs with three or four distinct (normalized) Laplacian eigenvalues
- Graphs with four distinct Laplacian eigenvalues
- On co-edge-regular graphs with 4 distinct eigenvalues
- On the least eigenvalue of genuine strongly 3-walk-regular graphs
- On walk-semiregular graphs with three or four distinct eigenvalues
- Equiangular lines in Euclidean spaces
- On graphs with three distinct Laplacian eigenvalues
- Q-integral graphs with edge-degrees at most five
This page was built for publication: Small regular graphs with four eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584360)
