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
| < Previous Terms | Terms Containing Moore bound | Next Terms > |
| Montage Monte Carlo monty MOO Moof | graph Moore graph | Moore graph Moore's Law moose call MooZ Mops |
