Try Our Apps


Supposedly vs. Supposably

moore bound

moore bound in Technology

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

The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source

Word of the Day

Word Value for moore

Scrabble Words With Friends

Nearby words for moore bound