The distance dG(u, v) between two (not necessary distinct) vertices u and v in a graph G is the length of a shortest path between them. The subscript G is usually dropped when there is no danger of confusion. When u and v are identical, their distance is 0. When u and v are unreachable from each other, their distance is defined to be infinity ∞.
The eccentricity εG(v) of a vertex v in a graph G is the maximum distance from v to any other vertex. The diameter diam(G) of a graph G is the maximum eccentricity over all vertices in a graph; and the radius rad(G), the minimum. When there are two components in G, diam(G) and rad(G) defined to be infinity ∞. Trivially, diam(G) ≤ 2 rad(G). Vertices with maximum eccentricity are called peripheral vertices. Vertices of minimum eccentricity form the center. A tree has at most two center vertices.
The Wiener index of a vertex v in a graph G, denoted by WG(v) is the sum of distances between v and all others. The Wiener index of a graph G, denoted by W(G), is the sum of distances over all pairs of vertices. An undirected graph's Wiener polynomial is defined to be Σ qd(u,v) over all unordered pairs of vertices u and v. Wiener index and Wiener polynomial are of particular interest to mathematical chemists.
The k-th power Gk of a graph G is a supergraph formed by adding an edge between all pairs of vertices of G with distance at most k. A second power of a graph is also called a square.
A k-spanner is a spanning subgraph, S, in which every two vertices are at most k times as far apart on S than on G. The number k is the dilation. k-spanner is used for studying geometric network optimization.
Read more about this topic: Glossary Of Graph Theory
Famous quotes containing the word distance:
“Midway the lake we took on board two manly-looking middle-aged men.... I talked with one of them, telling him that I had come all this distance partly to see where the white pine, the Eastern stuff of which our houses are built, grew, but that on this and a previous excursion into another part of Maine I had found it a scarce tree; and I asked him where I must look for it. With a smile, he answered that he could hardly tell me.”
—Henry David Thoreau (1817–1862)
“1946: I go to graduate school at Tulane in order to get distance from a “possessive” mother. I see a lot of a red-haired girl named Maude-Ellen. My mother asks one day: “Does Maude-Ellen have warts? Every girl I’ve known named Maude-Ellen has had warts.” Right: Maude-Ellen had warts.”
—Bill Bouke (20th century)
“Letters to absence can a voice impart,
And lend a tongue when distance gags the heart.”
—Horace Walpole (1717–1797)