A natural upper bound for the maximum number of vertices in a mixed graph with maximum undirected degree r, maximum directed out-degree z and diameter k is given by the mixed Moore bound. Graphs with order attaining the Moore bound are known as Moore graphs, and they are very rare. Besides, graphs with prescribed parameters and order one less than the corresponding Moore bound are known as almost Moore graphs. In this paper we prove that there is a unique mixed almost Moore graph of diameter k = 2 and parameters r = 2 and z = 1.
To our beloved friend Mirka Miller. She would love to see this result concerning mixed Moore graphs. Research of Nacho López and Josep M. Miret was supported in part by grants MTM2013-46949-P (Spanish Ministerio de Economa y Competitividad) and 2014SGR-1666 (Generalitat de Catalunya).
Inglés
Moore graph; Mixed graph; Diameter
World Scientific Publishing
MINECO/PN2013-2016/MTM2013-46949-P
Versió preprint del document publicat a: https://doi.org/10.1142/S0219265917410055
Journal of Interconnection Networks, 2017, vol. 17, núm. 3, p. 1741005-1-1741005-10
(c) World Scientific Publishing, 2017
Documents de recerca [17848]