Title :
A note on radially Moore digraphs
Author_Institution :
Dept. of Math., Slovak Tech. Univ., Bratislava, Slovakia
fDate :
3/1/1996 12:00:00 AM
Abstract :
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
Keywords :
directed graphs; telecommunication networks; Moore digraph; Moore digraphs; center; communication network; digraph; distance; radially Moore digraph; radius; regular digraph; Communication networks; Computer networks; Distributed computing; Greedy algorithms; Switching systems; Upper bound;
Journal_Title :
Computers, IEEE Transactions on
