Moore graph

English

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

Moore graph (plural Moore graphs)

(graph theory) A regular graph of degree d and diameter k whose number of vertices equals the upper bound ${\\displaystyle 1+d\\sum _{i=0}^{k-1}(d-1)^{i}}$ .

单词	Moore graph
释义	Moore graph English Etymology Named in 1960 by Hoffman and Singleton, after Edward F. Moore, who posed the question of describing and classifying these graphs. Noun Moore graph (plural Moore graphs) (graph theory) A regular graph of degree d and diameter k whose number of vertices equals the upper bound ${\\displaystyle 1+d\\sum _{i=0}^{k-1}(d-1)^{i}}$ .
随便看	akárkiről akárkit akárkitől akárkivel akárkivé akárkié akárkiért akármeddig akármekkora akármelyik akármennyi akármennyire akármerre akármerről akármi akármiféle akármikor akármilyen akár tetszik, akár nem akásica akásicas akásico akásicos akát akáta