A general method to obtain the spectrum and local spectra of a graph from its regular partitions

zbMATH Open1444.05089arXiv1901.08048MaRDI QIDQ3299352FDOQ3299352

C. Dalfó, Miquel Angel Fiol

Publication date: 22 July 2020

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 $Gamma$ 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.

Full work available at URL: https://arxiv.org/abs/1901.08048

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

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

zbMATH Keywords

eigenvaluesadjacency matrixcompletely regular codespectrumwalk-regular graphlocal multiplicities\(C\)-local spectrum

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Theory of error-correcting codes and error-detecting codes (94B99)

Cites Work

• Spectra of graphs
• Developments on spectral characterizations of graphs
• Distance-regularised graphs are distance-regular or distance-biregular
• An introduction to the theory of graph spectra
• On the Shannon capacity of a graph
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Association schemes and coding theory
• Title not available (Why is that?)
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Title not available (Why is that?)
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• An excess theorem for spherical 2-designs
• Feasibility conditions for the existence of walk-regular graphs
• Inverses of Vandermonde Matrices
• Algebraic characterizations of distance-regular graphs
• An algebraic characterization of completely regular codes in distance-regular graphs
• On the algebraic theory of pseudo-distance-regularity around a set
• Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
• Boundary graphs: The limit case of a spectral property
• A differential approach for bounding the index of graphs under perturbations
• Orbit polynomial graphs of prime order
• Quotient-polynomial graphs
• Developments in the theory of graph spectra
• A survey on the missing Moore graph
• A Note on the Order of Iterated Line Digraphs

Cited In (3)

• On the Laplacian spectra of token graphs
• On symmetric association schemes and associated quotient-polynomial graphs
• Title not available (Why is that?)

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)