distance (graph theory)

In graph theory, given an (undirected) graph the *graph distance* is, if it exists, the function that assigns to any subset of 2 vertices the length of the minimum path of edges between them, hence the minimum number of consecutive edges needed to connect the two vertices.

In geometric group theory the graph distance of the Cayley graph of a finitely generated group serves to equip with group with a metric.

See also

- Wikipedia,
*Distance (graph theory)*

Created on April 17, 2021 at 10:44:45. See the history of this page for a list of all contributions to it.