Pseudo-Strong Regularity Around a Set

DOI10.1080/03081080290011719zbMath0996.05091OpenAlexW2047218311MaRDI QIDQ4542167

E. Garriga, Miquel Àngel Fiol

Publication date: 3 November 2002

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081080290011719

zbMATH Keywords

distance-regular graphstrongly regular graphlocal spectrum

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (3)

The Laplacian spectral excess theorem for distance-regular graphs ⋮ Spectral bounds and distance-regularity ⋮ Eigenvalue interlacing and weight parameters of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of distance-regular graphs with diameter three
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Bounds on special subsets in graphs, eigenvalues and association schemes
• Interlacing eigenvalues and graphs
• Distance-regularity and the spectrum of graphs
• On a class of polynomials and its relation with the spectra and diameters of graphs
• From regular boundary graphs to antipodal distance-regular graphs
• On the algebraic theory of pseudo-distance-regularity around a set

This page was built for publication: Pseudo-Strong Regularity Around a Set