You are here: irt.org | FOLDOC | diameter
The diameter of a graph is the maximum value of the minimum distance between any two nodes.
Nearby terms: DIALOG « dialup « DIAMAG « diameter » Diamond » DIANA » DIB
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