From local adjacency polynomials to locally pseudo-distance-regular graphs

DOI10.1006/jctb.1997.1778zbMath0888.05056OpenAlexW1987779054MaRDI QIDQ1366602

E. Garriga, Miquel Àngel Fiol

Publication date: 15 September 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1997.1778

zbMATH Keywords

eigenvaluedistance-regular graphsspectrumregular grapheccentricitydistance polynomialslocal adjacency polynomialsorthogonal system of polynomialspseudo-distance-regular

Mathematics Subject Classification ID

Related Items (52)

Distance mean-regular graphs ⋮ Polynomial properties on large symmetric association schemes ⋮ On outindependent subgraphs of strongly regular graphs ⋮ On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs ⋮ Pseudo-Strong Regularity Around a Set ⋮ Characterizing \((\ell ,m)\)-walk-regular graphs ⋮ Edge-distance-regular graphs are distance-regular ⋮ On some approaches to the spectral excess theorem for nonregular graphs ⋮ Spectral determinations and eccentricity matrix of graphs ⋮ The spectral excess theorem for distance-biregular graphs. ⋮ On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes ⋮ A spectral equivalent condition of the \(P\)-polynomial property for association schemes ⋮ Spectral and Geometric Properties of k-Walk-Regular Graphs ⋮ Quotient-polynomial graphs ⋮ A generalization of the odd-girth theorem ⋮ On the spectra and spectral radii of token graphs ⋮ A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number ⋮ On almost distance-regular graphs ⋮ An excess theorem for spherical 2-designs ⋮ A spectral excess theorem for nonregular graphs ⋮ Which graphs are determined by their spectrum? ⋮ Dual concepts of almost distance-regularity and the spectral excess theorem ⋮ On symmetric association schemes and associated quotient-polynomial graphs ⋮ On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship ⋮ A characterization of bipartite distance-regular graphs ⋮ The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues ⋮ The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues ⋮ An odd characterization of the generalized odd graphs ⋮ A lower bound for the discriminant of polynomials related to Chebyshev polynomials ⋮ A spectral excess theorem for normal digraphs ⋮ The Laplacian spectral excess theorem for distance-regular graphs ⋮ A simple proof of the spectral excess theorem for distance-regular graphs ⋮ Some spectral and quasi-spectral characterizations of distance-regular graphs ⋮ On pseudo-distance-regularity ⋮ Edge-distance-regular graphs ⋮ Spectral bounds and distance-regularity ⋮ The geometry oft-spreads ink-walk-regular graphs ⋮ A spectral excess theorem for digraphs with normal Laplacian matrices ⋮ On the spectrum of an extremal graph with four eigenvalues ⋮ Algebraic characterizations of regularity properties in bipartite graphs ⋮ Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity ⋮ On a version of the spectral excess theorem ⋮ Optimization of eigenvalue bounds for the independence and chromatic number of graph powers ⋮ On the \(k\)-independence number of graphs ⋮ The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular ⋮ Three-class association schemes ⋮ On t-Cliques in k-Walk-Regular Graphs ⋮ A new family of distance-regular graphs with unbounded diameter ⋮ Graphs, friends and acquaintances ⋮ Spectral characterizations of some distance-regular graphs ⋮ A general method to obtain the spectrum and local spectra of a graph from its regular partitions ⋮ Spectrally extremal vertices, strong cospectrality, and state transfer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Locally pseudo-distance-regular graphs
• Girth, valency, and excess
• Feasibility conditions for the existence of walk-regular graphs
• Diameter, covering index, covering radius and eigenvalues
• Eigenvalues, diameter, and mean distance in graphs
• The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
• Distance biregular bipartite graphs
• Spectral diameter estimates for \(k\)-regular graphs
• Problems in algebraic combinatorics
• Eigenvalues, eigenspaces and distances to subsets
• A characterization of distance-regular graphs with diameter three
• Distance-regularised graphs are distance-regular or distance-biregular
• Distance-regularity and the spectrum of graphs
• On a class of polynomials and its relation with the spectra and diameters of graphs
• Isoperimetric Inequalities and Eigenvalues
• Diameters and Eigenvalues
• On the Polynomial of a Graph
• From regular boundary graphs to antipodal distance-regular graphs
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
• Developments in the theory of graph spectra
• Eigenvalues and the diameter of graphs

This page was built for publication: From local adjacency polynomials to locally pseudo-distance-regular graphs