The triameter of a connected graph with vertex set
and vertex count at least
3 is defined by (Das 2021)
where
is the graph distance between vertices
and
.
For a tree with
vertices and
leaves, Hak et al. (2022)
prove the sharp bound
where
is the floor function. Equality is attained by
a star graph whose
arms are subdivided to
have lengths differing by at most 1.
For a connected graph that is a block graph, every triple of vertices attaining the triameter contains a pair whose graph distance is the graph diameter. Conversely, every pair attaining the graph diameter extends to a triple attaining the triameter (Hak et al. 2022).
For a finite connected graph that is simple, let be the maximum size of a subset
of its vertex set whose distinct vertices
have graph distance greater than the positive
integer
. Hak and Kozerenko (2026) proved the sharp bound
. Consequently, for
vertices
and minimum vertex degree
,
, where
is the floor
function. The coefficient 6 is asymptotically best possible for each fixed
. If the girth is
at least 5, a further bound is
.
Among -vertex graphs of vertex
connectivity
, for
and
, the maximum triameter
is exactly
(Hak and Kozerenko 2026). For biconnected graphs
with
, this gives
. When equality is
, the order is odd and there is a unique maximizing
triple and a spanning theta graph formed by three
even-length paths whose midpoints are that triple.