Moore graph

名词 n.
中文释义

英文释义

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

词形变化

Moore graphs plural

词源

Named in 1960 by Hoffman and Singleton, after Edward F. Moore, who posed the question of describing and classifying these graphs.
0 次浏览 数据来源: Wiktionary