Weakly distance-regular digraphs

被引:25
作者
Wang, KS [1 ]
Suzuki, H
机构
[1] Beijing Normal Univ, Dept Math, Beijing 100875, Peoples R China
[2] Int Christian Univ, Dept Math, Mitaka, Tokyo 1818585, Japan
关键词
weakly distance-regular digraph; association scheme; Cayley digraph;
D O I
10.1016/S0012-365X(02)00562-9
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We consider the following generalization of distance-regular digraphs. A connected digraph F is said to be weakly distance-regular if, for all vertices x and y, with (partial derivative(x, y), partial derivative(y, x)) = (h) over tilde, \{z is an element of VGamma \ (partial derivative)(x,z), partial derivative(z,x)) = (i) over tilde and (partial derivative(z,y),partial derivative(y,z)) =(j) over tilde}\ depends only on (h) over tilde, (i) over tilde and (j) over tilde. We give some constructions of weakly distance-regular digraphs and discuss the connections to association schemes. Finally, we determine all commutative weakly distance-regular digraphs of valency 2. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:225 / 236
页数:12
相关论文
共 6 条
[1]   NONEXISTENCE OF CERTAIN DISTANCE-TRANSITIVE DIGRAPHS [J].
BANNAI, E ;
CAMERON, PJ ;
KAHN, J .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1981, 31 (01) :105-110
[2]  
Bannai E., 1984, Algebraic Combinatorics I
[3]  
Biggs N., 1993, ALGEBRAIC GRAPH THEO
[4]   DISTANCE-TRANSITIVE AND DISTANCE-REGULAR DIGRAPHS [J].
DAMERELL, RM .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1981, 31 (01) :46-53
[5]   DISTANCE TRANSITIVE DIGRAPHS [J].
LAM, CWH .
DISCRETE MATHEMATICS, 1980, 29 (03) :265-274
[6]   THE GIRTH OF A DIRECTED DISTANCE-REGULAR GRAPH [J].
LEONARD, DA ;
NOMURA, K .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1993, 58 (01) :34-39