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 |
adjacent vertex
Author: Marian Olejar, Jr. Created: Apr/12/2006 Last edit: Aug/21/2006
pl. adjacent vertices, adjacent vertexes
graph theory: other name: neighbour Two vertices u, v`in`V of graph G=(V, E) are called adjacent vertices (or neighbours), if uv is an edge of graph G. In other words: if they are the endpoints of the same edge. The multiply adjacent vertices are vertices connected with two or more edges. See also: adjacent edges, Cite this article as: Marian Olejar, Jr.: adjacent vertex from VeryPrime's Dictionary of mathematics Link to this page: http://www.veryprime.com/dict/adjacent_vertex.php |