arrow
Return

A note on radially Moore digraphs

delete1996-03-01
delete8
PRE
AI
M
Martin Knor *
DOI:10.1109/12.485578delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

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.
Keywords:
center
communication network
distance
Moore digraph
radius
regular digraph

Journal

IEEE Transactions on Computers cover
IEEE Transactions on Computers
IF:
3.8
Papers:
5.4K
Citations:
9.8K

Organization

No organization information available
Cited Papers

Cited Papers