Graph Triameter
Das (2018) 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 in V}, |
where d(i,j) is the graph distance between vertices i and j.
See also
Graph Diameter, Graph DistanceExplore with Wolfram|Alpha
WolframAlpha
References
Das, A. "Triameter of Graphs." 3 Apr 2018. https://arxiv.org/abs/1804.01088.Referenced on Wolfram|Alpha
Graph TriameterCite this as:
Weisstein, Eric W. "Graph Triameter." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/GraphTriameter.html