http://researchonline.federation.edu.au/vital/access/manager/Index ${session.getAttribute("locale")} 5 http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:521 Wed 07 Apr 2021 13:31:27 AEST ]]> http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:524 Wed 07 Apr 2021 13:31:27 AEST ]]> http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:100 1, diameter k > 1 is a diregular digraph with the number of vertices one less than the Moore bound. If G is an almost Moore digraph, then for each vertex u ∈ V (G) there exists a vertex v ∈ V (G), called repeat of u and denoted by r (u) = v, such that there are two walks of length ≤ k from u to v. The smallest positive integer p such that the composition rp (u) = u is called the order of u. If the order of u is 1 then u is called a selfrepeat. It is known that if G is an almost Moore digraph of diameter k ≥ 3 then G contains exactly k selfrepeats or none. In this paper, we propose an exact formula for the number of all vertex orders in an almost Moore digraph G containing selfrepeats, based on the vertex orders of the out-neighbours of any selfrepeat vertex. © 2007 Elsevier B.V. All rights reserved.]]> Wed 07 Apr 2021 13:30:55 AEST ]]> http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:93 Wed 07 Apr 2021 13:30:54 AEST ]]>