A Family of Dense Mixed Graphs of Diameter 2

Abstract

A mixed graph is said to be dense if its order is close to the Moore bound and it is optimal if there is not a mixed graph with the same parameters and bigger order. We present a construction that provides dense mixed graphs of undirected degree q, directed degree q-12 and order 2q2, for q being an odd prime power. Since the Moore bound for a mixed graph with these parameters is equal to 9q2-4q+34 the defect of these mixed graphs is (q-22)2-14. In particular we obtain a known mixed Moore graph of order 18, undirected degree 3 and directed degree 1 called Bos\'ak's graph and a new mixed graph of order 50, undirected degree 5 and directed degree 2, which is proved to be optimal.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…