Martin KNOR

(STU, Bratysława)

On radially Moore digraphs and graphs

A regular digrah $D$ with radius r and (out- and in-)degree d is radially Moore if it has the theoretically maximum number of vertices and its diameter does not exceed $r{+}1$.

We present a simple construction showing that a radially Moore digraph exists for every possible degree d and radius r.

Although the problem is easy for digraphs, analogous problem for graphs seems to be difficult.

We show some unsuccessfull approaches which gave not a general construction for graphs. Anyway, they gave us radially Moore graphs for small values of r and

Serdecznie zapraszamy wszystkich chętnych !