## Directed strongly walk-regular graphs. (arXiv:1508.05281v2 [math.CO] UPDATED)

We generalize the concept of strong walk-regularity to directed graphs. We call a digraph strongly $\ell$-walk-regular with $\ell >1$ if the number of walks of length $\ell$ from a vertex to anothe

## 发表评论

 用户名： 登录|注册账号 标题： 评论： 使用预览按钮！检查错误！引用添加:[quote][/quote] 链接添加:[url][/url] 匿名发表