A Note on Radially Moore Digraphs
暂无分享,去创建一个
Let D be a regular digraph with radius s. Then D is a radially Moore digraph if it has the maximum possible number of nodes and the diameter of D does not exceed s+1. We show that for each s and t there exists a regular radially Moors digraph of degree t with radius s. Moreover, we give an upper bound for the number of central nodes in radially Moore digraphs with degree two.
[1] Makoto Imase,et al. A Design for Directed Graphs with Minimum Diameter , 1983, IEEE Transactions on Computers.
[2] Sam Toueg,et al. On the impossibility of Directed Moore Graphs , 1980, J. Comb. Theory, Ser. B.
[3] Mirka Miller,et al. Digraphs of degree 3 and order close to the moore bound , 1995, J. Graph Theory.
[4] Miguel Angel Fiol,et al. Line Digraph Iterations and the (d, k) Digraph Problem , 1984, IEEE Transactions on Computers.