k-Walk-Regular Digraphs

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.