tree strength

There are several definitions of the strength of a graph. Harary and Palmer and Harary and Palmer define the strength of a tree as the maximum number of edges between any pair of vertices. This definition corresponds to a tree's graph diameter. Harary and Palmer define the strength of a multigraph as the maximum number of edges joining any two adjacent vertices.

graph diameter | graph distance matrix | graph strong product | graph toughness