A strongly connected digraph Gamma is said to be walk regular if for any nonnegative integer l and any vertex u of Gamma, the number of circuits of length l containing u depends only on l. This family of digraphs is a directed version of walk regular graphs. In this paper, we discuss some basic properties of walk regular digraphs.
机构:
Hebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R ChinaHebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R China
Guo, Zhengyu
Jia, Dongdong
论文数: 0引用数: 0
h-index: 0
机构:
Hebei Univ Sci & Technol, Sch Sci, Shijiazhuang 050018, Hebei, Peoples R ChinaHebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R China
Jia, Dongdong
Zhang, Gengsheng
论文数: 0引用数: 0
h-index: 0
机构:
Hebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R China
Hebei Key Lab Computat Math & Applicat, Shijiazhuang 050024, Hebei, Peoples R ChinaHebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R China