Line digraph iterations and the (d,k) problem for directed graphs
暂无分享,去创建一个
[1] Sam Toueg,et al. On the impossibility of Directed Moore Graphs , 1980, J. Comb. Theory, Ser. B.
[2] Kenneth Steiglitz,et al. The Design of Small-Diameter Networks by Local Search , 1979, IEEE Transactions on Computers.
[3] Makoto Imase,et al. Design to Minimize Diameter on Building-Block Network , 1981, IEEE Transactions on Computers.
[4] N.R. Malik,et al. Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.
[5] Gérard Memmi,et al. Some New Results About the (d, k) Graph Problem , 1982, IEEE Transactions on Computers.
[6] Charles Delorme,et al. Tables of Large Graphs with Given Degree and Diameter , 1982, Inf. Process. Lett..
[7] Narsingh Deo,et al. Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.