Thin weakly distance-regular digraphs

DOI10.1016/j.jctb.2004.04.004zbMath1052.05069OpenAlexW2045743529MaRDI QIDQ1880790

Hiroshi Suzuki

Publication date: 1 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.04.004

zbMATH Keywords

association schemesweakly distance-regular digraphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

Weakly distance-regular digraphs of valency three. I ⋮ Weakly distance-regular digraphs of one type of arcs ⋮ Weakly distance-regular digraphs of valency three, II ⋮ On weak metric dimension of digraphs ⋮ \(P\)-polynomial weakly distance-regular digraphs ⋮ A family of weakly distance-regular digraphs of girth 2 ⋮ Commutative weakly distance-regular digraphs of girth 2. ⋮ Deza digraphs ⋮ Quasi-thin weakly distance-regular digraphs ⋮ Thick weakly distance-regular digraphs

Cites Work

• Unnamed Item
• The girth of a directed distance-regular graph
• Distance-transitive and distance-regular digraphs
• Weakly distance-regular digraphs
• An algebraic approach to association schemes

This page was built for publication: Thin weakly distance-regular digraphs