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 |
imbedding
Author: Marian Olejar, Jr. Created: Sep/26/2006 Last edit: Oct/24/2006
graph theory, topology:
The imbedding of a graph in a surface is a continuous one-to-one function from a topological representation of the graph into the surface. If graph G is a subset of surface S, and the function `i:G->S` is the inclusion map. Then the imbedding can be denoted `G->S`. If the regions are all open disks, then the imbedding is called 2-cell imbedding. An imbedding of a nonempty finite graph in the plane cannot be cellular. See also: triangular imbedding, quadrilateral imbedding, Cite this article as: Marian Olejar, Jr.: imbedding from VeryPrime's Dictionary of mathematics Link to this page: http://www.veryprime.com/dict/imbedding.php |