Algebraic characterizations of graph regularity conditions
From MaRDI portal
Recommendations
Cites work
- 1-homogeneous, pseudo-1-homogeneous, and 1-thin distance-regular graphs
- Algebraic characterizations of distance-regular graphs
- Almost 2-homogeneous bipartite distance-regular graphs
- Distance-regularised graphs are distance-regular or distance-biregular
- Homogeneous graphs and regular near polygons
- Locally pseudo-distance-regular graphs
- On rank 3 permutation groups
- On spin models, triply regular association schemes, and duality
- On the algebraic theory of pseudo-distance-regularity around a set
- On the Polynomial of a Graph
- The girth of a thin distance-regular graph
- The subconstituent algebra of an association scheme. I
Cited in
(7)- Algebraic characterizations of distance-regular graphs
- 1-homogeneous, pseudo-1-homogeneous, and 1-thin distance-regular graphs
- The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two
- Algebraic characterizations of regularity properties in bipartite graphs
- scientific article; zbMATH DE number 2144997 (Why is no real title available?)
- Alliance polynomial of regular graphs
- Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs
This page was built for publication: Algebraic characterizations of graph regularity conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1766109)