A general method to obtain the spectrum and local spectra of a graph from its regular partitions
From MaRDI portal
Publication:3299352
Abstract: It is well known that, in general, part of the spectrum of a graph can be obtained from the adjacency matrix of its quotient graph given by a regular partition. In this paper, we propose a method to obtain all the spectrum, and also the local spectra, of a graph from the quotient matrices of some of its regular partitions. As examples, it is shown how to find the eigenvalues and (local) multiplicities of walk-regular, distance-regular, and distance-biregular graphs.
Recommendations
- scientific article; zbMATH DE number 6276186
- A theory of spectral partitions of metric graphs
- Regular graphs. A spectral approach
- A new method for constructing graphs determined by their generalized spectrum
- The local spectra of regular line graphs
- Regularity and the generalized adjacency spectra of graphs
- Spectra and optimal partitions of weighted graphs
- Theorems on partitioned matrices revisited and their applications to graph spectra
- On the local geometry of graphs in terms of their spectra
- Generalizing \(p\)-Laplacian: spectral hypergraph theory and a partitioning algorithm
Cites work
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- A Note on the Order of Iterated Line Digraphs
- A differential approach for bounding the index of graphs under perturbations
- A survey on the missing Moore graph
- Algebraic characterizations of distance-regular graphs
- An algebraic characterization of completely regular codes in distance-regular graphs
- An excess theorem for spherical 2-designs
- An introduction to the theory of graph spectra
- Association schemes and coding theory
- Boundary graphs: The limit case of a spectral property
- Combinatorics. Room squares, sum-free sets, Hadamard matrices
- Developments in the theory of graph spectra
- Developments on spectral characterizations of graphs
- Distance-regularised graphs are distance-regular or distance-biregular
- Feasibility conditions for the existence of walk-regular graphs
- From local adjacency polynomials to locally pseudo-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
- On the algebraic theory of pseudo-distance-regularity around a set
- Orbit polynomial graphs of prime order
- Quotient-polynomial graphs
- Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
- Spectra of graphs
Cited in
(5)- On symmetric association schemes and associated quotient-polynomial graphs
- The local spectra of regular line graphs
- On the Laplacian spectra of token graphs
- Spectra and eigenspaces from regular partitions of Cayley (di)graphs of permutation groups
- scientific article; zbMATH DE number 6276186 (Why is no real title available?)
This page was built for publication: A general method to obtain the spectrum and local spectra of a graph from its regular partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3299352)
