triameter

Das defines the triameter of a connected graph G with vertex set V and vertex count at least 3 as tr(G) = max{d(u, v) + d(v, w) + d(u, w):u, v, w element V}, where d(i, j) is the graph distance between vertices i and j.

graph diameter | graph distance