A general method to obtain the spectrum and local spectra of a graph from its regular partitions
From MaRDI portal
Publication:3299352
zbMath1444.05089arXiv1901.08048MaRDI QIDQ3299352
Publication date: 22 July 2020
Full work available at URL: https://arxiv.org/abs/1901.08048
eigenvaluesspectrumadjacency matrixcompletely regular codewalk-regular graphlocal multiplicities\(C\)-local spectrum
Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (2)
On symmetric association schemes and associated quotient-polynomial graphs ⋮ On the Laplacian spectra of token graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An excess theorem for spherical 2-designs
- A differential approach for bounding the index of graphs under perturbations
- Spectra of graphs
- Quotient-polynomial graphs
- Developments on spectral characterizations of graphs
- Orbit polynomial graphs of prime order
- Feasibility conditions for the existence of walk-regular graphs
- Algebraic characterizations of distance-regular graphs
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- Distance-regularised graphs are distance-regular or distance-biregular
- Boundary graphs: The limit case of a spectral property
- Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
- A survey on the missing Moore graph
- Combinatorics. Room squares, sum-free sets, Hadamard matrices
- An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs
- Inverses of Vandermonde Matrices
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- On the Shannon capacity of a graph
- Association schemes and coding theory
- Developments in the theory of graph spectra
- A Note on the Order of Iterated Line Digraphs
- On the algebraic theory of pseudo-distance-regularity around a set
This page was built for publication: A general method to obtain the spectrum and local spectra of a graph from its regular partitions
