Weakly distance-regular digraphs

DOI10.1016/S0012-365X(02)00562-9MaRDI QIDQ1869256zbMATH OpenOpenAlexFDO

Authors Kaishun Wang, H. Suzuki

Publication date 9 April 2003

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(02)00562-9

zbMATH Keywords

association schemeCayley digraphweakly distance-regular digraph

Mathematics Subject Classification ID

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

Recommendations

• Commutative 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
• The construction of weakly distance-regular digraph

Cited in

(26)

• Cayley digraphs with normal adjacency matrices
• Weakly distance-regular digraphs.
• Commutative weakly distance-regular digraphs of girth 2.
• Weakly distance-regular digraphs of valency three, II
• Thin weakly distance-regular digraphs
• Some constructions of quasi-strongly regular digraphs
• Thick weakly distance-regular digraphs
• Weakly distance-regular digraphs of one type of arcs
• Quasi-thin weakly distance-regular digraphs
• Minimum cuts of 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
• Finite \(s\)-geodesic-transitive digraphs
• 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: Weakly distance-regular digraphs

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