moore_graph (649B)
1 # Moore graph 2 3 https://en.wikipedia.org/wiki/Moore_graph 4 5 Connect as many [vertex] as possible while limiting [graph_diameter] and [graph_degree] 6 7 A Moore graph is a [graph] satisfying the Moore bound on [degree] and 8 [diameter] (cf also [girth]): 9 - the bound is the obvious one where summing the number of vertices reachable at the indicated distance 10 - [open_problems]: open for [degree] 57 whether a Moore graph exists 11 12 [miller2013moore] and also mentioned in [cranston2023coloring] 13 14 Records: https://en.wikipedia.org/wiki/Table_of_the_largest_known_graphs_of_a_given_diameter_and_maximal_degree 15 16 Up: [graph] 17 18 See also: [extremal_graph_theory]