Directed distance regular graphs with the Q-polynomial property
From MaRDI portal
(Redirected from Publication:757407)
Recommendations
- A characterization of \(Q\)-polynomial distance-regular graphs
- On nonsymmetric \(P\)- and \(Q\)-polynomial association schemes
- On few-class \(Q\)-polynomial association schemes: feasible parameters and nonexistence results
- Non-symmetric, metric, cometric association schemes are self-dual
- A remark on association schemes with two P-polynomial structures
Cites work
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3891388 (Why is no real title available?)
- Certain distance-regular digraphs and related rings of characteristic 4
- Distance transitive digraphs
- Distance-transitive and distance-regular digraphs
- Orthogonal Polynomials, Duality and Association Schemes
- Parameters of association schemes that are both P- and Q-polynomial
Cited in
(10)- Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg}
- scientific article; zbMATH DE number 3891388 (Why is no real title available?)
- Metrically regular square of metrically regular bipartite graphs of diameter \(D=7\).
- scientific article; zbMATH DE number 611187 (Why is no real title available?)
- Parameters of quotient-polynomial graphs
- Metric coset schemes revisited
- \(P\)-polynomial weakly distance-regular digraphs
- The subconstituent algebra of an association scheme. I
- Non-symmetric, metric, cometric association schemes are self-dual
- On nonsymmetric \(P\)- and \(Q\)-polynomial association schemes
This page was built for publication: Directed distance regular graphs with the Q-polynomial property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757407)
