Further results on almost Moore digraphs
暂无分享,去创建一个
[1] O. Heuchenne,et al. SUR UNE CERTAINE CORRESPONDANCE ENTRE GRAPHES , 1994 .
[2] Miguel Angel Fiol,et al. The connectivity of large digraphs and graphs , 1993, J. Graph Theory.
[3] Miguel Angel Fiol,et al. Line digraph iterations and the (d,k) problem for directed graphs , 1983, ISCA '83.
[4] Makoto Imase,et al. A Design for Directed Graphs with Minimum Diameter , 1983, IEEE Transactions on Computers.
[5] Kenneth Steiglitz,et al. The Design of Small-Diameter Networks by Local Search , 1979, IEEE Transactions on Computers.
[6] Mirka Miller,et al. Minimum Diameter of Diregular Digraphs of Degree 2 , 1988, Comput. J..
[7] Mirka Miller,et al. Regular digraphs of diameter 2 and maximum order , 1994, Australas. J Comb..
[8] M. A. Fiol,et al. Dense bipartite digraphs , 1990, J. Graph Theory.
[9] Sam Toueg,et al. On the impossibility of Directed Moore Graphs , 1980, J. Comb. Theory, Ser. B.
[10] 徐俊明. AN INEQUALITY RELATING THE ORDER, MAXIMUM DEGREE, DIAMETER AND CONNECTIVITY OF A STRONGLY CONNECTED DIGRAPH , 1992 .
[11] Mirka Miller,et al. Digraphs of degree 3 and order close to the moore bound , 1995, J. Graph Theory.
[12] Miguel Angel Fiol,et al. Vertex-symmetric Digraphs with Small Diameter , 1995, Discret. Appl. Math..