Distance-regularity and the spectrum of graphs
From MaRDI portal
Publication:1911436
DOI10.1016/0024-3795(94)00166-9zbMath0845.05101OpenAlexW2005608963WikidataQ56001786 ScholiaQ56001786MaRDI QIDQ1911436
Publication date: 26 August 1996
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://pure.uvt.nl/ws/files/1142205/HW5613176.pdf
Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (14)
Pseudo-Strong Regularity Around a Set ⋮ Regular graphs with four eigenvalues ⋮ Characterizing distance-regularity of graphs by the spectrum ⋮ A characterization of distance-regular graphs with diameter three ⋮ From local adjacency polynomials to locally pseudo-distance-regular graphs ⋮ Which graphs are determined by their spectrum? ⋮ Constructions of cospectral graphs with different zero forcing numbers ⋮ Some spectral and quasi-spectral characterizations of distance-regular graphs ⋮ Cospectral pairs of regular graphs with different connectivity ⋮ The smallest pair of cospectral cubic graphs with different chromatic indexes ⋮ Three-class association schemes ⋮ On the \(p\)-ranks of the adjacency matrices of distance-regular graphs ⋮ Spectral characterizations of some distance-regular graphs ⋮ Equitable switching and spectra of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing cospectral graphs
- A new family of symmetric 2-(\(v, k, {\lambda{}}\)) block designs
- The Gewirtz graph: An exercise in the theory of graph spectra
- There exists no distance-regular graph with intersection array \((5,4,3;1,1,2)\)
- Eigenvalues of the adjacency matrix of cubic lattice graphs
- Eigenvalues of the adjacency matrix of tetrahedral graphs
- Applications of a theorem on partitioned matrices
- On the Polynomial of a Graph
- Regular 2-Graphs
- Graphs cospectral with distance-regular graphs
This page was built for publication: Distance-regularity and the spectrum of graphs