Quotient-polynomial graphs
From MaRDI portal
Abstract: As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph. In these graphs every vertex induces the same regular partition around , where all vertices of each cell are equidistant from . Some properties and characterizations of such graphs are studied. For instance, all quotient-polynomial graphs are walk-regular and distance-polynomial. Also, we show that every quotient-polynomial graph generates a (symmetric) association scheme.
Recommendations
Cites work
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Feasibility conditions for the existence of walk-regular graphs
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- Locally pseudo-distance-regular graphs
- On almost distance-regular graphs
- On distance-regularity in graphs
- On the Polynomial of a Graph
- Orbit polynomial graphs of prime order
- Problems in algebraic combinatorics
- Three-class association schemes
- Trivalent orbit polynomial graphs
Cited in
(8)- On symmetric association schemes and associated quotient-polynomial graphs
- Quotients of association schemes
- On a version of the spectral excess theorem
- Parameters of quotient-polynomial graphs
- Trivalent orbit polynomial graphs
- 2-walk-regular dihedrants from group-divisible designs
- scientific article; zbMATH DE number 6300018 (Why is no real title available?)
- A general method to obtain the spectrum and local spectra of a graph from its regular partitions
This page was built for publication: Quotient-polynomial graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896860)