Content deleted Content added
→top: this one needs it too |
Short description |
||
Line 1:
{{Use American English|date = February 2019}}
{{Short description|Embedding a graph in a topological space, often Euclidean}}
{{Use mdy dates|date = February 2019}}
In [[topological graph theory]], an '''embedding''' (also spelled '''imbedding''') of a [[Graph (discrete mathematics)|graph]] <math>G</math> on a [[surface (mathematics)|surface]] <math>\Sigma</math> is a representation of <math>G</math> on <math>\Sigma</math> in which points of <math>\Sigma</math> are associated with [[graph theory|vertices]] and simple arcs ([[Homeomorphism|homeomorphic]] images of <math>[0,1]</math>) are associated with [[graph theory|edges]] in such a way that:
* the endpoints of the arc associated with an edge <math>e</math> are the points associated with the end vertices of <math>e,</math>
* no arcs include points associated with other vertices,
| |||