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 , directed degree and order , for being an odd prime power. Since the Moore bound for a mixed graph with these parameters is equal to the defect of these mixed graphs is . In particular we obtain a known mixed Moore graph of order , undirected degree and directed degree called Bos\'ak's graph and a new mixed graph of order , undirected degree and directed degree , which is proved to be optimal.
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