论文信息 - Counting Closed Walks in Generalized de Bruijn Graphs - 字舞流文

Counting Closed Walks in Generalized de Bruijn Graphs

Yukio Shibata | Shingo Osawa | Miyuki Shirahata | Y. Shibata | Miyuki Shirahata | S. Osawa

[1] Makoto Imase,et al. Design to Minimize Diameter on Building-Block Network , 1981, IEEE Transactions on Computers.

[2] Makoto Imase,et al. A Design for Directed Graphs with Minimum Diameter , 1983, IEEE Transactions on Computers.

[3] de Ng Dick Bruijn. A combinatorial problem , 1946 .

[4] Ding-Zhu Du,et al. Generalized de Bruijn digraphs , 1988, Networks.