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
		  ------------
		      d-2

Try this search on Wikipedia, OneLook, Google

Nearby terms:

monty « MOO « Moof « Moore bound » Moore graph » Moore's Law » moose call

Loading