On (4, 2)-digraphs containing a cycle of length 2 (Q5952798)

Given positive integers \(d\) and \(k\), the order \(n\) of a digraph of out-degree at most \(d\) and diameter at most \(k\) is bounded from above by the Moore bound \(M_{d,k}=1+d+d^2+\cdots +d^k\). A \((d,k)\)-digraph is a diregular digraph of out-degree as well as in-degree \(d\), diameter \(k\) and order \(n=M_{d,k}-1\). In this paper (4, 2)-digraphs are studied. It is shown that if such a digraph \(G\) contains a cycle of length 2 then \(G\) must be the line digraph of the complete digraph \(K_5\).