Enumerations of vertex orders of almost Moore digraphs with ...
www.sciencedirect.com › article › pii
In this paper, we propose an exact formula for the number of all vertex orders in an almost Moore digraph G containing selfrepeats.
Enumerations of vertex orders of almost Moore digraphs with selfrepeats; Creator: Baskoro, Edy; Cholily, Yus Mochamad; Miller, Mirka; Date: 2008; Type: Text ...
Jan 1, 2008 · 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 ...
Enumerations of vertex orders of almost Moore digraphs with selfrepeats ... An almost Moore digraph G of degree d>1d>1, diameter k>1k>1 is a diregular digraph ...
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 ...
Enumerations of vertex orders of almost Moore digraphs with selfrepeats ... If G is an almost Moore digraph, then for each vertex u ∈ V (G) there exists a ...
Oct 26, 2024 · In this paper we study the structure of the subdigraphs of an almost Moore digraph induced by the vertices fixed by an automorphism determined ...
It is known that if G is an almost Moore digraph of diameter k⩾3k⩾3 then G contains exactly k selfrepeats or none. In this paper, we propose an exact formula ...
Jun 17, 2022 · Cholily, M. Miller, Enumeration of vertex orders of almost Moore digraphs with selfrepeats, Discrete Math. 308(1): 123–128, 2008.
An almost Moore (d; 2)-digraph is a regular directed graph of degree d ¿ 1, diameter k = 2 and order n one less than the (unattainable) Moore bound.