Issue No. 03 - March (1996 vol. 45)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.485578
<p><b>Abstract</b>—Let <it>D</it> be a regular digraph with radius <it>s</it>. Then <it>D</it> is a radially Moore digraph if it has the maximum possible number of nodes and the diameter of <it>D</it> does not exceed <it>s</it> + 1. We show that for each <it>s</it> and <it>t</it> there exists a regular radially Moore digraph of degree <it>t</it> with radius <it>s</it>. Moreover, we give an upper bound for the number of central nodes in radially Moore digraphs with degree two.</p>
Center, communication network, distance, Mooredigraph, radius, regular digraph.
M. Knor, "A Note on Radially Moore Digraphs," in IEEE Transactions on Computers, vol. 45, no. , pp. 381-383, 1996.