The Diameter of Cyclic Kautz Digraphs

Electronic Notes in Discrete Mathematics - Tập 49 - Trang 323-330 - 2015
K. Böhmová1
1Dept. of Computer Science, ETH Zürich, Switzerland

Tài liệu tham khảo

Fiol, 1992, The partial line digraph technique in the design of large interconnection networks, IEEE Trans. Comput., 41, 848, 10.1109/12.256453 Fiol, 1984, Line digraph iterations and the (d,k) digraph problem, IEEE Trans. Comput., C-33, 400, 10.1109/TC.1984.1676455 Li, 2004, 308 van Lint, 1992 Miller, 2013, Moore graphs and beyond: A survey of the degree/diameter problem, Electron. J. Combin., 20 Miller, 2013, Construction techniques for digraphs with minimum diameter, LNCS, 8288, 327