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 |
inner vertex
Author: Marian Olejar, Jr. Created: May/04/2006 Last edit: May/04/2006
graph theory:
If `P = x_0x_1x_2x_3...x_n` is path in graph G = (V, E), `x_0` and `x_n` are called endpoints (ends) of path P. All vertices `x_1, ..., x_(n-1)` are called inner vertices. Cite this article as: Marian Olejar, Jr.: inner vertex from VeryPrime's Dictionary of mathematics Link to this page: http://www.veryprime.com/dict/inner_vertex.php |