Regular graphs with four eigenvalues
From MaRDI portal
Publication:1899403
Recommendations
Cites work
- 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?)
- Distance-regularity and the spectrum of graphs
- Feasibility conditions for the existence of walk-regular graphs
- GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES
- Graphs cospectral with distance-regular graphs
- 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
(81)- On graphs with three distinct Laplacian eigenvalues
- A spectral characterization of the \(s\)-clique extension of the square grid graphs
- Regular 4‐critical graphs of even degree
- Combinatorial designs with two singular values. I: Uniform multiplicative designs
- Graphs whose certain polynomials have few distinct roots
- The expected hitting times for finite Markov chains
- Integral eigen-pair balanced classes of graphs with their ratio, asymptote, area, and involution-complementary aspects
- On graphs with three distinct signless Laplacian eigenvalues
- On 2-equitable graphs
- Two characterizations of the grid graphs
- scientific article; zbMATH DE number 1877028 (Why is no real title available?)
- Graphs with three distinct eigenvalues and largest eigenvalue less than 8
- Integral circulant graphs with four distinct eigenvalues
- Two spectral characterizations of regular, bipartite graphs with five eigenvalues
- A spectral characterization of the \(s\)-clique extension of the triangular graphs
- On the \(p\)-ranks of the adjacency matrices of distance-regular graphs
- Combinatorial designs with two singular values. II: Partial geometric designs
- Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\)
- Design of highly synchronizable and robust networks
- A nonregular analogue of conference graphs
- On regular signed graphs with three eigenvalues
- Regular bipartite graphs with three distinct non-negative eigenvalues
- Graphs with two main and two plain eigenvalues
- Graphs whose normalized Laplacian has three eigenvalues
- Graphs with constant \(\mu\) and \(\overline{\mu}\)
- The edge-connectivity of strongly 3-walk-regular graphs
- On the spectrum of an extremal graph with four eigenvalues
- Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues
- Largest regular multigraphs with three distinct eigenvalues
- Graphs with few distinct eigenvalues and extremal energy
- Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)
- Characterization of graphs with an eigenvalue of large multiplicity
- Variance and concurrence in block designs, and distance in the corresponding graphs
- Which graphs are determined by their spectrum?
- Some spectral characterizations of strongly distance-regular graphs
- Algebraic characterizations of regularity properties in bipartite graphs
- Graphs (networks) with golden spectral ratio
- A generalization of a theorem of Hoffman
- Graphs with four distinct Laplacian eigenvalues
- Some constructions of integral graphs
- The local structure of a bipartite distance-regular graph
- Monotonic normalized heat diffusion for regular bipartite graphs with four eigenvalues
- Universal adjacency matrices with two eigenvalues
- Walk-regular divisible design graphs
- A characterization of distance-regular graphs with diameter three
- Three-class association schemes
- The eigenvalues of the graphs \(D(4,q)\)
- A note on graphs whose signless Laplacian has three distinct eigenvalues
- Geometric aspects of 2-walk-regular graphs
- Equiangular frames and generalizations of the Welch bound to dual pairs of frames
- On regular graphs with four distinct eigenvalues
- Equiangular Frames and Their Duals
- scientific article; zbMATH DE number 4055652 (Why is no real title available?)
- An application of Hoffman graphs for spectral characterizations of graphs
- Small regular graphs with four eigenvalues
- Graphs with fourth Laplacian eigenvalue less than two
- Graphs with many valencies and few eigenvalues
- Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues
- Bounds on special subsets in graphs, eigenvalues and association schemes
- Regular graphs of degree at most four that allow two distinct eigenvalues
- On symmetric and Hermitian rank distance codes
- Strongly walk-regular graphs
- Spectra of strongly Deza graphs
- Thin distance-regular graphs with classical parameters \((D, q, q, \frac{q^t-1}{q-1}-1)\) with \(t> D\) are the Grassmann graphs
- The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5
- Seidel spectrum of threshold graphs
- A new construction of strongly regular graphs with parameters of the complement symplectic graph
- Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\)
- Finding planted subgraphs with few eigenvalues using the Schur-Horn relaxation
- On the automorphism groups of rank-4 primitive coherent configurations
- On the roots of total domination polynomial of graphs. II
- TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS
- Trees with Four and Five Distinct Signless Laplacian Eigenvalues
- On the spectrum of derangement graphs of order a product of three primes
- On split graphs with three or four distinct (normalized) Laplacian eigenvalues
- Spectra of quasi-strongly regular graphs
- On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity
- Characterization of strongly regular integral circulant graphs by spectral approach
- Unicyclic graphs with five Laplacian eigenvalues different from 0 and 1
- A characterization of the Grassmann graphs
- Neumaier graphs with few 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)
