A note on radially Moore digraphs

doi:10.1109/12.485578

1996-03-01

PRE

Martin Knor *

DOI：10.1109/12.485578

原文链接

原文求助

摘要

En 中文

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 Moore 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.

Keyword:

center

communication network

distance

Moore digraph

radius

regular digraph