This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. Permission MUST be requested prior to use.
(c) Marian Olejar, Jr., 2005-2007
|
Mathematical Search Engine |
|
|
topic index: Complex Analysis Graph Theory Number Theory Plane Geometry Solid Geometry Statistics Topology locations: dictionary help with math text search |
length of path
Author: Marian Olejar, Jr. Created: May/04/2006 Last edit: May/04/2006
graph theory:
Let `P = x_0 x_1 ... x_n`, `x_0Px_n` be a path in graph G = (V, E). The number of edges in path P is called length of path and it is denoted by `P^n`. If G has only 1 vertex then `P^0 = K^1` (where `K^1` is complete graph on 1 vertex, or isolated vertex). Cite this article as: Marian Olejar, Jr.: length of path from VeryPrime's Dictionary of mathematics Link to this page: http://www.veryprime.com/dict/length_of_path.php |