P-polynomial weakly distance-regular digraphs

DOI10.37236/11798MaRDI QIDQ6170519zbMATH OpenOpenAlexFDO

Authors Qing Zeng, Yuefeng Yang, Kaishun Wang

Publication date 10 August 2023

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2210.16121

zbMATH Keywords

attached scheme of a graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Association schemes, strongly regular graphs (05E30)

Abstract: A weakly distance-regular digraph is $P$-polynomial if its attached scheme is $P$-polynomial. In this paper, we characterize all $P$-polynomial weakly distance-regular digraphs.

Review text

Summary: A weakly distance-regular digraph is \(P\)-polynomial if its attached scheme is \(P\)-polynomial. In this paper, we characterize all \(P\)-polynomial weakly distance-regular digraphs.

Cites work

• An algebraic approach to association schemes
• Certain distance-regular digraphs and related rings of characteristic 4
• Commutative weakly distance-regular digraphs of circle with fixed length.
• Commutative weakly distance-regular digraphs of girth 2.
• Directed distance regular graphs with the Q-polynomial property
• Distance-regular digraphs of girth 4
• Distance-transitive and distance-regular digraphs
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• On nonsymmetric P- and Q-polynomial association schemes
• Quasi-thin weakly distance-regular digraphs
• The girth of a directed distance-regular graph
• Theory of Association Schemes
• Thick weakly distance-regular digraphs
• Thin weakly distance-regular digraphs
• Weakly distance-regular digraphs
• Weakly distance-regular digraphs of valency three, II
• Weakly distance-regular digraphs of valency three. I

Cited in

(9)

• Commutative weakly distance-regular digraphs of circle with fixed length.
• scientific article; zbMATH DE number 1379440 (Why is no real title available?)
• Weakly distance-regular digraphs whose underlying graphs are distance-regular. I
• Semicomplete multipartite weakly distance-regular digraphs
• Weakly distance-regular circulants. I
• On the combinatorial structure and algebraic characterizations of distance-regular digraphs
• Every nonsymmetric 4-class association scheme can be generated by a digraph
• On commutative association schemes and associated (directed) graphs
• Weakly distance-regular digraphs whose underlying graphs are distance-regular. II

This page was built for publication: \(P\)-polynomial weakly distance-regular digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170519)