Pseudo-Strong Regularity Around a Set
From MaRDI portal
Publication:4542167
Recommendations
- Some spectral characterizations of strongly distance-regular graphs
- Pseudo-distance-regularized graphs are distance-regular or distance-biregular
- On the algebraic theory of pseudo-distance-regularity around a set
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- Locally pseudo-distance-regular graphs
Cites work
- A characterization of distance-regular graphs with diameter three
- Bounds on special subsets in graphs, eigenvalues and association schemes
- Distance-regularity and the spectrum of graphs
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- From regular boundary graphs to antipodal distance-regular graphs
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- Interlacing eigenvalues and graphs
- On a class of polynomials and its relation with the spectra and diameters of graphs
- On the algebraic theory of pseudo-distance-regularity around a set
Cited in
(9)- Eigenvalue interlacing and weight parameters of graphs
- Spectral bounds and distance-regularity
- The Laplacian spectral excess theorem for distance-regular graphs
- Some spectral characterizations of strongly distance-regular graphs
- scientific article; zbMATH DE number 437617 (Why is no real title available?)
- Pseudo-similarity and partial unit regularity
- scientific article; zbMATH DE number 3927546 (Why is no real title available?)
- On pseudo-distance-regularity
- On the algebraic theory of pseudo-distance-regularity around a set
This page was built for publication: Pseudo-Strong Regularity Around a Set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542167)