Moore bound

An upper limit on the number of nodes in a regular graph of degree d>2 and diameter k:

	N(d,k) <= d(d-1)^k - 2


Try this search on OneLook / Google

Nearby terms: Montaigne Michel Eyquem de « Montesquieu Charles-Louis de Secondat « mood and figure « Moore bound » Moore George Edward » Moore graph » Moore's Law