| The Bessel Numbers and Bessel Matrices |
| Received:January 05, 2010 Revised:May 28, 2010 |
| Key Words:
$k$-walk-regular digraph predistance polynomial the crossed $uv$-local multiplicity.
|
| Fund Project:Supported by the National Natural Science Foundation of China (Grant Nos.10771051; 10971052), the National Natural Foundation of Hebei Province (Grant No.A2008000128), Educational Committee of Hebei Province (Grant No.2009134) and Youth Science Foundation of Hebei Normal University (Grant No.L2008Q01). |
|
| Hits: 2527 |
| Download times: 1913 |
| Abstract: |
| 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. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.2011.04.007 |
| View Full Text View/Add Comment |
