Regular graphs with four eigenvalues
From MaRDI portal
Connected regular graphs having at most three distinct eigenvalues are the complete and the strongly regular graphs. Distance-regular graphs of diameter \(d\) are generalizations of complete \((d= 1)\) and strongly regular \((d= 2)\) graphs. The present paper studies the connected regular graphs with four distinct eigenvalues. Properties and feasibility conditions of the eigenvalues are presented. The paper also gives several constructions, some characterizations, and uniqueness and nonexistence results.
Recommendations
Cites work
- Distance-regularity and the spectrum of graphs
- Feasibility conditions for the existence of walk-regular graphs
- Graphs cospectral with distance-regular graphs
- GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES
- scientific article; zbMATH DE number 3884175 (Why is no real title available?)
- scientific article; zbMATH DE number 3668628 (Why is no real title available?)
- scientific article; zbMATH DE number 3670480 (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 3539163 (Why is no real title available?)
- scientific article; zbMATH DE number 3608081 (Why is no real title available?)
- scientific article; zbMATH DE number 3432307 (Why is no real title available?)
- On characterizing certain graphs with four eigenvalues by their spectra
- On spectral characterization and embeddings of graphs
- On the Polynomial of a Graph
- Pseudocyclic 3-class association schemes on 28 points
- Strongly regular graphs having strongly regular subconstituents
- Strongly regular graphs with strongly regular decomposition
- The Gewirtz graph: An exercise in the theory of graph spectra
- XOR-based visual cryptography schemes
Cited in
(88)- Graphs with three distinct eigenvalues and largest eigenvalue less than 8
- Variance and concurrence in block designs, and distance in the corresponding graphs
- Three-class association schemes
- Distance-regular graphs with an eigenvalue of multiplicity four
- A characterization of distance-regular graphs with diameter three
- Graphs with constant \(\mu\) and \(\overline{\mu}\)
- Bounds on special subsets in graphs, eigenvalues and association schemes
- Graphs with fourth Laplacian eigenvalue less than two
- Which graphs are determined by their spectrum?
- Small regular graphs with four eigenvalues
- On the p-ranks of the adjacency matrices of distance-regular graphs
- A spectral characterization of the \(s\)-clique extension of the square grid graphs
- A generalization of a theorem of Hoffman
- Combinatorial designs with two singular values. II: Partial geometric designs
- Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\)
- A nonregular analogue of conference graphs
- Strongly walk-regular graphs
- Regular bipartite graphs with three distinct non-negative eigenvalues
- 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
- On symmetric and Hermitian rank distance codes
- Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues
- Thin distance-regular graphs with classical parameters \((D, q, q, \frac{q^t-1}{q-1}-1)\) with \(t> D\) are the Grassmann graphs
- Seidel spectrum of threshold graphs
- Neumaier graphs with few eigenvalues
- Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)
- Spectra of strongly Deza graphs
- Characterization of graphs with an eigenvalue of large multiplicity
- Walk-regular divisible design graphs
- On regular signed graphs with three eigenvalues
- A spectral characterization of the \(s\)-clique extension of the triangular graphs
- The edge-connectivity of strongly 3-walk-regular graphs
- The eigenvalues of the graphs \(D(4,q)\)
- Largest regular multigraphs with three distinct eigenvalues
- Geometric aspects of 2-walk-regular graphs
- Graphs (networks) with golden spectral ratio
- On the spectrum of an extremal graph with four eigenvalues
- Algebraic characterizations of regularity properties in bipartite graphs
- A new construction of strongly regular graphs with parameters of the complement symplectic graph
- Some spectral characterizations of strongly distance-regular graphs
- A note on graphs whose signless Laplacian has three distinct eigenvalues
- Some constructions of integral graphs
- On regular graphs with four distinct eigenvalues
- On the roots of total domination polynomial of graphs. II
- scientific article; zbMATH DE number 4055652 (Why is no real title available?)
- Regular 4‐critical graphs of even degree
- 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
- Integral eigen-pair balanced classes of graphs with their ratio, asymptote, area, and involution-complementary aspects
- scientific article; zbMATH DE number 1877028 (Why is no real title available?)
- TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS
- On the spectrum of derangement graphs of order a product of three primes
- Equiangular Frames and Their Duals
- Characterization of strongly regular integral circulant graphs by spectral approach
- On graphs with three distinct signless Laplacian eigenvalues
- Unicyclic graphs with five Laplacian eigenvalues different from 0 and 1
- On 2-equitable graphs
- An application of Hoffman graphs for spectral characterizations of graphs
- Trees with Four and Five Distinct Signless Laplacian Eigenvalues
- Equiangular frames and generalizations of the Welch bound to dual pairs of frames
- Graphs with many valencies and few eigenvalues
- 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
- Combinatorial designs with two singular values. I: Uniform multiplicative designs
- Spectra of quasi-strongly regular graphs
- Regular graphs of degree at most four that allow two distinct eigenvalues
- Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\)
- Graphs with two main and two plain eigenvalues
- On the automorphism groups of rank-4 primitive coherent configurations
- 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
- Design of highly synchronizable and robust networks
- Graphs with four distinct Laplacian eigenvalues
- A characterization of the Grassmann graphs
- On co-edge-regular graphs with 4 distinct eigenvalues
- Strongly regular graphs decomposable into a divisible design graph and a Delsarte clique
- Spectral measures and dominant vertices in graphs of bounded degree
- Graphs with three and four distinct eigenvalues based on circulants
- On the least eigenvalue of genuine strongly 3-walk-regular graphs
- On walk-semiregular graphs with three or four distinct eigenvalues
- The expected hitting times for finite Markov chains
- On graphs with three distinct Laplacian eigenvalues
This page was built for publication: Regular graphs with four eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1899403)
