A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
The degree/diameter problem for directed graphs is the problem of determining the largest possible order for a digraph with given maximum out-degree d and diameter k. An upper bound is given by the Moore bound M (d, k) = k i=0 d i and almost Moore digraphs are digraphs with maximum out-degree d, diameter k and order M (d, k) − 1. In this paper we will look at the structure of subdigraphs of almost Moore digraphs, which are induced by the vertices fixed by some automorphism ϕ. If thedoi:10.5614/ejgta.2015.3.1.1 fatcat:27tds2zlrvg6xftmb2765svhbe