You are here: irt.org | FOLDOC | 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
Nearby terms: monty « MOO « Moof « Moore bound » Moore graph » Moore's Law » moose call
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL