Commutative weakly distance-regular digraphs of girth 2.

DOI10.1016/J.EJC.2003.09.009MaRDI QIDQ1427434zbMATH OpenOpenAlexFDO

Authors Kaishun Wang

Publication date 14 March 2004

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2003.09.009

zbMATH Keywords

Cayley digraph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Recommendations

• A family of weakly distance-regular digraphs of girth 2
• Weakly distance-regular digraphs
• Weakly distance-regular digraphs of valency three, II
• Weakly distance-regular digraphs of one type of arcs
• Weakly distance-regular digraphs of valency three. I

Cites work

• An algebraic approach to association schemes
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3492731 (Why is no real title available?)
• Thin weakly distance-regular digraphs
• Weakly distance-regular digraphs

Cited in

(23)

• Certain distance-regular digraphs and related rings of characteristic 4
• Weakly distance-regular digraphs.
• Weakly distance-regular digraphs of valency three, II
• Weakly distance-regular digraphs
• Thin weakly distance-regular digraphs
• Thick weakly distance-regular digraphs
• Weakly distance-regular digraphs of one type of arcs
• Quasi-thin weakly distance-regular digraphs
• A family of weakly distance-regular digraphs of girth 2
• Deza digraphs
• Weakly distance-regular digraphs of valency three. I
• Commutative weakly distance-regular digraphs of circle with fixed length.
• On the Spectrum of a Weakly Distance-Regular Digraph
• The construction of weakly distance-regular digraph
• On weak metric dimension of digraphs
• \(P\)-polynomial weakly distance-regular digraphs
• 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: Commutative weakly distance-regular digraphs of girth 2.

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