Moore bound

from The Free On-line Dictionary of Computing (8 July 2008)
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
    

[email protected]