Moore graph

短语

词形变化

Moore graphs 复数 Moore graphs

释义与例句

n.
  1. 1.

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

    数学

词源

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

来源：wiktionary