P-polynomial weakly distance-regular digraphs
From MaRDI portal
Publication:6170519
DOI10.37236/11798zbMATH Open1519.05262arXiv2210.16121OpenAlexW4384447697MaRDI QIDQ6170519FDOQ6170519
Authors: Qing Zeng, Yuefeng Yang, Kaishun Wang 
Publication date: 10 August 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: A weakly distance-regular digraph is -polynomial if its attached scheme is -polynomial. In this paper, we characterize all -polynomial weakly distance-regular digraphs.
Full work available at URL: https://arxiv.org/abs/2210.16121
Directed graphs (digraphs), tournaments (05C20) Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- Distance-transitive and distance-regular digraphs
- 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
- Weakly distance-regular digraphs of valency three. I
- Theory of Association Schemes
- The girth of a directed distance-regular graph
- Certain distance-regular digraphs and related rings of characteristic 4
- Distance-regular digraphs of girth 4
- On nonsymmetric \(P\)- and \(Q\)-polynomial association schemes
- Directed distance regular graphs with the Q-polynomial property
- Thick weakly distance-regular digraphs
- Quasi-thin weakly distance-regular digraphs
- Commutative weakly distance-regular digraphs of circle with fixed length.
Cited In (3)
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)
