Moore graph

noun

A regular graph of degree d and diameter k whose number of vertices equals the upper bound 1+d∑ᵢ₌₀ᵏ⁻¹(d-1)ⁱ.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

nounMoore graph (plural Moore graphs)

plural Moore graphs

  1. graph theoryA regular graph of degree d and diameter k whose number of vertices equals the upper bound 1+d∑ᵢ₌₀ᵏ⁻¹(d-1)ⁱ.

Origin

Named in 1960 by Hoffman and Singleton, after Edward F. Moore, who posed the question of describing and classifying these graphs.

Full word history & related roots →
Cite this entry
APA

Moore graph. (n.d.). In WatkinsX Dictionary. Retrieved November 2, 2026, from https://dictionary.watkinsx.com/word/Moore%20graph

MLA

“Moore graph.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Moore%20graph. Accessed November 2, 2026.

Chicago

WatkinsX Dictionary, s.v. “Moore graph,” accessed November 2, 2026, https://dictionary.watkinsx.com/word/Moore%20graph.

Source: Moore graph on Wiktionary, CC BY-SA 4.0.