Weakly distance-regular digraphs of valency three, II

DOI10.1016/j.jcta.2018.07.001zbMath1394.05055arXiv1611.07764OpenAlexW2884514431MaRDI QIDQ1671784

Yuefeng Yang, Benjian Lv, Kaishun Wang

Publication date: 7 September 2018

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

association schemeCayley digraphweakly distance-regular digraph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12)

Related Items (6)

Weakly distance-regular digraphs of valency three. I ⋮ Weakly distance-regular digraphs of one type of arcs ⋮ On weak metric dimension of digraphs ⋮ \(P\)-polynomial weakly distance-regular digraphs ⋮ Quasi-thin weakly distance-regular digraphs ⋮ Thick weakly distance-regular digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weakly distance-regular digraphs of valency three. I
• On primitive commutative association schemes with a nonsymmetric relation of valency 4
• Commutative weakly distance-regular digraphs of girth 2.
• Weakly distance-regular digraphs
• Thin weakly distance-regular digraphs
• An algebraic approach to association schemes
• Generalized table algebras
• Primitive commutative association schemes with a non-symmetric relation of valency 3
• Quasi-thin weakly distance-regular digraphs
• Theory of Association Schemes

This page was built for publication: Weakly distance-regular digraphs of valency three, II