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 qq, directed degree q−12\frac{q-1}{2} and order 2q22q^2, for qq being an odd prime power. Since the Moore bound for a mixed graph with these parameters is equal to 9q2−4q+34\frac{9q^2-4q+3}{4} the defect of these mixed graphs is (q−22)2−14({\frac{q-2}{2}})^2-\frac{1}{4}. In particular we obtain a known mixed Moore graph of order 1818, undirected degree 33 and directed degree 11 called Bosák's graph and a new mixed graph of order 5050, undirected degree 55 and directed degree 22, which is proved to be optimal.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.