In graph theory, the triameter is a metric invariant that generalizes the concept of a graph's diameter. It is defined as the maximum sum of pairwise distances between any three vertices in a connected graph G {\textstyle G} and is denoted by where V {\textstyle V} is the vertex set of G {\textstyle G} and d ( u , v ) {\textstyle d(u,v)} is the length of the shortest path between vertices u {\textstyle u} and v {\textstyle v} .
In graph theory, the triameter is a metric invariant that generalizes the concept of a graph's diameter. It is defined as the maximum sum of pairwise distances between any three vertices in a connected graph G {\textstyle G} and is denoted by where V {\textstyle V} is the vertex set of G {\textstyle G} and d ( u , v ) {\textstyle d(u,v)} is the length of the shortest path between vertices u {\textstyle u} and v {\textstyle v} .
Source: Wikipedia "Triameter (graph theory)" · CC BY-SA 4.0
Share this article: X · Bluesky