论文信息 - Some Conditions for the Existence of ( d, k)-Digraphs

Some Conditions for the Existence of ( d, k)-Digraphs

A (d,k)-digraph is a diregular digraph of degree d ≥ 4, diameter k ≥ 3 and the number of vertices d+d2+...+dk. The existence problem of (d,k)-digraphs is one of difficult problem. In this paper, we will present some new necessary conditions for the existence of such digraphs.

[1] Charles Delorme,et al. Strategies for Interconnection Networks: Some Methods from Graph Theory , 1986, J. Parallel Distributed Comput..

[2] Joan Gimbert,et al. Enumeration of almost Moore digraphs of diameter two , 2001, Discret. Math..

[3] Miguel Angel Fiol,et al. Line digraph iterations and the (d,k) problem for directed graphs , 1983, ISCA '83.

[4] Mirka Miller,et al. Further results on almost Moore digraphs , 2000, Ars Comb..

[5] M. A. Fiol,et al. Dense bipartite digraphs , 1990, J. Graph Theory.

[6] Mirka Miller,et al. Minimum Diameter of Diregular Digraphs of Degree 2 , 1988, Comput. J..

[7] Sam Toueg,et al. On the impossibility of Directed Moore Graphs , 1980, J. Comb. Theory, Ser. B.

[8] Mirka Miller,et al. On the Structure of Digraphs with Order Close to the Moore Bound , 1998, Graphs Comb..

[9] Mirka Miller,et al. Complete characterization of almost Moore digraphs of degree three , 2005 .

[10] Joan Gimbert,et al. On the existence of ( d,k )-digraphs , 1999 .

[11] Mirka Miller,et al. Almost Moore digraphs are diregular , 2000, Discret. Math..