English

A Family of Dense Mixed Graphs of Diameter $2$

Combinatorics 2015-11-20 v1

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 q12\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 9q24q+34\frac{9q^2-4q+3}{4} the defect of these mixed graphs is (q22)214({\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\'ak's graph and a new mixed graph of order 5050, undirected degree 55 and directed degree 22, which is proved to be optimal.

Keywords

Cite

@article{arxiv.1511.06050,
  title  = {A Family of Dense Mixed Graphs of Diameter $2$},
  author = {Gabriela Araujo-Pardo and Camino Balbuena and M. Miller and M. Ždímalová},
  journal= {arXiv preprint arXiv:1511.06050},
  year   = {2015}
}

Comments

14 pages, 2 figures