\(P\)-polynomial weakly distance-regular digraphs

DOI10.37236/11798zbMath1519.05262arXiv2210.16121OpenAlexW4384447697MaRDI QIDQ6170519

Yuefeng Yang, Qing Zeng, Kaishun Wang

Publication date: 10 August 2023

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

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

zbMATH Keywords

attached scheme of a graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Weakly distance-regular digraphs of valency three. I
• Directed distance regular graphs with the Q-polynomial property
• The girth of a directed distance-regular graph
• Certain distance-regular digraphs and related rings of characteristic 4
• Distance-regular digraphs of girth 4
• Distance-transitive and distance-regular digraphs
• On nonsymmetric \(P\)- and \(Q\)-polynomial association schemes
• Commutative weakly distance-regular digraphs of girth 2.
• Weakly distance-regular digraphs of valency three, II
• Weakly distance-regular digraphs
• Thin weakly distance-regular digraphs
• An algebraic approach to association schemes
• Thick weakly distance-regular digraphs
• Quasi-thin weakly distance-regular digraphs
• Theory of Association Schemes

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