Word.ws English Dictionary

Moore graph

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

Noun

Moore graph (plural Moore graphs)

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

Forms of Moore graph

pluralMoore graphs

Origin of Moore graph

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

Questions about Moore graph

What does Moore graph mean?
Moore graph means a regular graph of degree d and diameter k whose number of vertices equals the upper bound 1+d∑ᵢ₌₀ᵏ⁻¹(d-1)ⁱ.
What part of speech is Moore graph?
Moore graph is a noun.
What is the plural of Moore graph?
The plural of Moore graph is Moore graphs.

Words near Moore graph in the dictionary

  1. Moorcroft
  2. Moorcrofts
  3. Moore
  4. Moore County
  5. Moore Creek
  6. Moore graph
  7. Moore graphs
  8. Moore Haven
  9. Moore machine
  10. Moore machines
  11. Moore neighborhood

Source and license

Adapted from Wiktionary: Moore graph (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Moore graph.” Word.ws, https://word.ws/moore_graph. Based on Wiktionary, CC BY-SA 4.0.