 The distance d(u, v} between two vertices u and v is the length of the shortest path connecting them. Given a vertex n, the largest distance between u and any other vertex of the graph is called the eccentricity e(u) of the vertex u. The largest eccentricity...  Rigid Body Kinematics and C++ Code - Page 19by Sergio Pissanetzky - 2005 - 700 pagesLimited preview - About this book
 | John L. Volakis, Arindam Chatterjee, Leo C. Kempel - Science - 1998 - 364 pages
...The distance between two vertices d(vh c,) is the length of the shortest connected path between them. The largest distance between u, and any other vertex of the graph is called the eccentricity of the vertex e(^). The vertex with the largest eccentricity is called the peripheral vertex. Since... | |
 | Sergio Pissanetzky - 1984 - 324 pages
...path exists having u and v as its end points. A path is a cycle when 1*1 = ttm+i. The distance d(u,v] between two vertices u and v is the length of the...eccentricity is equal to the diameter of the graph. Many sparse matrix algorithms which operate on the graph associated with the matrix, require a "starting"... | |
| |
