A Mixed Graph Achieving A Moore-like Bound

2022/06/14 by Exoo, Geoffrey · 1 citation
#05C35. 05C20 #05C38 #Combinatorics (math.CO) #FOS: Mathematics #G.2.2

paper · doi:10.48550/arxiv.2206.07153

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.

Cited by

• New upper bounds on the order of mixed cages of girth 6

Related

• On Mixed Cages of Girth 6
• A Note on Mixed Cages of Girth 5
• An improved Moore bound for mixed graphs
• New upper bounds on the order of mixed cages of girth 6
• Mixed Cages: monotony, connectivity and upper bounds