Enumerations of vertex orders of almost Moore digraphs with selfrepeats
The number \(n\) of vertices of a digraph with maximum out-degree \(d\) and diameter \(k\) cannot exceed the Moore bound \(M_{d,k}=1+d+d^2+\cdots +d^k\). It is known that except in trivial cases Moore digraphs (those with \(n=M_{d,k}\)) do not exist. The authors study almost Moore digraphs (\(n=M_{d,k}-1\)) via the notion repeat. A vertex \(v\) is called a repeat of a vertex \(u\) if there are two \(u\)-\(v\) walks of length not exceeding \(k\), which is denoted by \(r(u)=v\). The smallest positive integer \(p\) such that \(r^p(u)=u\) is called the order of \(u\). A selfrepeat is a vertex of order one. This notion has been studied in several papers (see e.g. \textit{E. T. Baskoro, Y. M. Cholily} and \textit{M. Miller} [Bull. Inst. Comb. Appl. 46, 99--109 (2006; Zbl 1099.05046)]). In this paper, an exact formula is given for the number of all vertex orders based on the vertex orders of the out-neighbours of any selfrepeat vertex.
- Enumeration of almost Moore digraphs of diameter two
- On the structure of digraphs with order close to the Moore bound
- scientific article; zbMATH DE number 3319305
- Divisibility conditions in almost Moore digraphs with selfrepeats
- scientific article; zbMATH DE number 1792622
- Nonexistence of almost Moore digraphs of degrees 4 and 5 with self-repeats
- Enumeration problems for classes of self-similar graphs
- Digraphs of degree 3 and order close to the moore bound
- An alternative enumeration of self-complementary graphs
- A conjecture on the existence of almost Moore digraphs
- Almost Moore digraphs are diregular
- Combinatorial Geometry and Graph Theory
- Complete characterization of almost Moore digraphs of degree three
- Enumeration of almost Moore digraphs of diameter two
- scientific article; zbMATH DE number 426169 (Why is no real title available?)
- scientific article; zbMATH DE number 3455291 (Why is no real title available?)
- scientific article; zbMATH DE number 1792622 (Why is no real title available?)
- Minimum Diameter of Diregular Digraphs of Degree 2
- On the existence of \((d,k)\)-digraphs
- On the impossibility of directed Moore graphs
- On the structure of digraphs with order close to the Moore bound
- Structure of repeat cycles in almost Moore digrpahs with selfrepeats and diameter 3
- On the nonexistence of almost Moore digraphs
- Distances of centroid sets in a graph-based construction for information security applications
- Nonexistence of almost Moore digraphs of degrees 4 and 5 with self-repeats
- Divisibility conditions in almost Moore digraphs with selfrepeats
- Subdigraphs of almost Moore digraphs induced by fixpoints of an automorphism
- Ideal basis in constructions defined by directed graphs
- On the nonexistence of almost Moore digraphs with self-repeats
This page was built for publication: Enumerations of vertex orders of almost Moore digraphs with selfrepeats
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463473)
