A Mixed Graph Achieving A Moore-like Bound
Combinatorics
2023-11-02 v2
Abstract
Mixed graphs have both directed and undirected edges. A mixed cage is a regular mixed graph of given girth with minimum possible order. In this paper we construct a mixed cage of order 30 that achieves the mixed graph analogue of the Moore bound for degree 3, out-degree 1, and girth 6.
Keywords
Cite
@article{arxiv.2206.07153,
title = {A Mixed Graph Achieving A Moore-like Bound},
author = {Geoffrey Exoo},
journal= {arXiv preprint arXiv:2206.07153},
year = {2023}
}
Comments
3 pages, 1 figure