A Mixed Graph Achieving A Moore-like Bound

MaRDI QIDQ6402123FDO

Authors Geoffrey Exoo

Publication date 14 June 2022

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

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.

This page was built for publication: A Mixed Graph Achieving A Moore-like Bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402123)