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 |
incident
Author: Marian Olejar, Jr. Created: Apr/11/2006 Last edit: May/17/2006
graph theory:
A vertex is incident with an edge if it is one of the two vertices of the edge (if edge is a loop, it is its only vertex). More formal: In graph G = (V, E) is vertex v`in`V incident with edge e`in`E if v`in`e. Then v is called endpoint, endvertex or end. Further reading: 1. Diestel, Reinhard: Graph Theory, Graduate Texts in Mathematics, Springer, 2005, ISBN: 3540261826 2. Godsil, Chris; Royle, Gordon: Algebraic Graph Theory, Graduate Texts in Mathematics, Springer, 2001, ISBN: 0387952209 Cite this article as: Marian Olejar, Jr.: incident from VeryPrime's Dictionary of mathematics Link to this page: http://www.veryprime.com/dict/incident.php |