In this paper, we define a class of strongly connected digraph, called the k-walk- regular digraph, study some properties of it, provide its some algebraic characterization and point out that the 0-walk-regular digrap...In this paper, we define a class of strongly connected digraph, called the k-walk- regular digraph, study some properties of it, provide its some algebraic characterization and point out that the 0-walk-regular digraph is the same as the walk-regular digraph discussed by Liu and Lin in 2010 and the D-walk-regular digraph is identical with the weakly distance-regular digraph defined by Comellas et al in 2004.展开更多
基金Supported by the National Natural Science Foundation of China (Grant Nos.1077105110971052)+2 种基金the National Natural Foundation of Hebei Province (Grant No.A2008000128)Educational Committee of Hebei Province(Grant No.2009134)Youth Science Foundation of Hebei Normal University (Grant No.L2008Q01)
文摘In this paper, we define a class of strongly connected digraph, called the k-walk- regular digraph, study some properties of it, provide its some algebraic characterization and point out that the 0-walk-regular digraph is the same as the walk-regular digraph discussed by Liu and Lin in 2010 and the D-walk-regular digraph is identical with the weakly distance-regular digraph defined by Comellas et al in 2004.
