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 |
open walk
Author: Marian Olejar, Jr. Created: Aug/27/2006 Last edit: Aug/27/2006
graph theory:
The walk `v_0e_1v_1e_1...e_(k-1)v_k` in graph G = (V, E) where `AAv_i in V` and `AAe_i in E` where `v_0 != v_k`. If all vertices are distinc, then an open walk is called path. See also: closed walk, Cite this article as: Marian Olejar, Jr.: open walk from VeryPrime's Dictionary of mathematics Link to this page: http://www.veryprime.com/dict/open_walk.php |