Regular graphs with four eigenvalues
From MaRDI portal
Publication:1899403
DOI10.1016/0024-3795(94)00346-FzbMATH Open0839.05072MaRDI QIDQ1899403FDOQ1899403
Authors: Edwin R. Van Dam 
Publication date: 18 June 1996
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- The Gewirtz graph: An exercise in the theory of graph spectra
- Title not available (Why is that?)
- On the Polynomial of a Graph
- On spectral characterization and embeddings of graphs
- Feasibility conditions for the existence of walk-regular graphs
- GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES
- Strongly regular graphs having strongly regular subconstituents
- On characterizing certain graphs with four eigenvalues by their spectra
- Strongly regular graphs with strongly regular decomposition
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs cospectral with distance-regular graphs
- Title not available (Why is that?)
- Distance-regularity and the spectrum of graphs
- Title not available (Why is that?)
- Pseudocyclic 3-class association schemes on 28 points
- XOR-based visual cryptography schemes
- Title not available (Why is that?)
Cited In (78)
- A spectral characterization of the \(s\)-clique extension of the triangular graphs
- On the spectrum of an extremal graph with four eigenvalues
- Algebraic characterizations of regularity properties in bipartite graphs
- On graphs with three distinct signless Laplacian eigenvalues
- Two characterizations of the grid graphs
- Variance and concurrence in block designs, and distance in the corresponding graphs
- A generalization of a theorem of Hoffman
- Geometric aspects of 2-walk-regular graphs
- Three-class association schemes
- Graphs with fourth Laplacian eigenvalue less than two
- Equiangular Frames and Their Duals
- Two spectral characterizations of regular, bipartite graphs with five eigenvalues
- A characterization of distance-regular graphs with diameter three
- Bounds on special subsets in graphs, eigenvalues and association schemes
- Thin distance-regular graphs with classical parameters \((D, q, q, \frac{q^t-1}{q-1}-1)\) with \(t> D\) are the Grassmann graphs
- On 2-equitable graphs
- Graphs whose normalized Laplacian has three eigenvalues
- Characterization of graphs with an eigenvalue of large multiplicity
- Which graphs are determined by their spectrum?
- Graphs with constant \(\mu\) and \(\overline{\mu}\)
- The eigenvalues of the graphs \(D(4,q)\)
- A spectral characterization of the \(s\)-clique extension of the square grid graphs
- Graphs with few distinct eigenvalues and extremal energy
- On graphs with three distinct Laplacian eigenvalues
- The expected hitting times for finite Markov chains
- Graphs with three distinct eigenvalues and largest eigenvalue less than 8
- Graphs with four distinct Laplacian eigenvalues
- Equiangular frames and generalizations of the Welch bound to dual pairs of frames
- Combinatorial designs with two singular values. I: Uniform multiplicative designs
- A note on graphs whose signless Laplacian has three distinct eigenvalues
- Integral circulant graphs with four distinct eigenvalues
- Universal adjacency matrices with two eigenvalues
- Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\)
- Title not available (Why is that?)
- The edge-connectivity of strongly 3-walk-regular graphs
- A nonregular analogue of conference graphs
- Title not available (Why is that?)
- On symmetric and Hermitian rank distance codes
- Graphs whose certain polynomials have few distinct roots
- Integral eigen-pair balanced classes of graphs with their ratio, asymptote, area, and involution-complementary aspects
- Design of highly synchronizable and robust networks
- Regular bipartite graphs with three distinct non-negative eigenvalues
- Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)
- On regular graphs with four distinct eigenvalues
- Regular 4‐critical graphs of even degree
- Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation
- Strongly walk-regular graphs
- On regular signed graphs with three eigenvalues
- Graphs with two main and two plain eigenvalues
- Walk-regular divisible design graphs
- Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues
- Some constructions of integral graphs
- Monotonic normalized heat diffusion for regular bipartite graphs with four eigenvalues
- Small regular graphs with four eigenvalues
- Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues
- An application of Hoffman graphs for spectral characterizations of graphs
- Combinatorial designs with two singular values. II: Partial geometric designs
- On the \(p\)-ranks of the adjacency matrices of distance-regular graphs
- Some spectral characterizations of strongly distance-regular graphs
- Graphs (networks) with golden spectral ratio
- The local structure of a bipartite distance-regular graph
- ON THE SPECTRUM OF DERANGEMENT GRAPHS OF ORDER A PRODUCT OF THREE PRIMES
- On the automorphism groups of rank-4 primitive coherent configurations
- On split graphs with three or four distinct (normalized) Laplacian eigenvalues
- Spectra of strongly Deza graphs
- ON THE ROOTS OF TOTAL DOMINATION POLYNOMIAL OF GRAPHS, II
- Seidel spectrum of threshold graphs
- Spectra of quasi-strongly regular graphs
- Neumaier graphs with few eigenvalues
- TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS
- Characterization of strongly regular integral circulant graphs by spectral approach
- A new construction of strongly regular graphs with parameters of the complement symplectic graph
- A characterization of the Grassmann graphs
- On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity
- Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\)
- Trees with Four and Five Distinct Signless Laplacian Eigenvalues
- Title not available (Why is that?)
- The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5
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)
