Embedding a graph in a topological space, often Euclidean
The Heawood graph and associated map embedded in the torus.
In topological graph theory, an embedding (also spelled imbedding) of a graph on a surface is a representation of on in which points of are associated with vertices and simple arcs (homeomorphic images of ) are associated with edges in such a way that:
the endpoints of the arc associated with an edge are the points associated with the end vertices of
no arcs include points associated with other vertices,
two arcs never intersect at a point which is interior to either of the arcs.
Here a surface is a connected -manifold.
Informally, an embedding of a graph into a surface is a drawing of the graph on the surface in such a way that its edges may intersect only at their endpoints. It is well known that any finite graph can be embedded in 3-dimensional Euclidean space .[1] A planar graph is one that can be embedded in 2-dimensional Euclidean space
Often, an embedding is regarded as an equivalence class (under homeomorphisms of ) of representations of the kind just described.
Some authors define a weaker version of the definition of "graph embedding" by omitting the non-intersection condition for edges. In such contexts the stricter definition is described as "non-crossing graph embedding".[2]
This article deals only with the strict definition of graph embedding. The weaker definition is discussed in the articles "graph drawing" and "crossing number".
^Cohen, Robert F.; Eades, Peter; Lin, Tao; Ruskey, Frank (1995), "Three-dimensional graph drawing", in Tamassia, Roberto; Tollis, Ioannis G. (eds.), Graph Drawing: DIMACS International Workshop, GD '94 Princeton, New Jersey, USA, October 10–12, 1994, Proceedings, Lecture Notes in Computer Science, vol. 894, Springer, pp. 1–11, doi:10.1007/3-540-58950-3_351, ISBN 978-3-540-58950-1.
^Katoh, Naoki; Tanigawa, Shin-ichi (2007), "Enumerating Constrained Non-crossing Geometric Spanning Trees", Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, Lecture Notes in Computer Science, vol. 4598, Springer-Verlag, pp. 243–253, CiteSeerX 10.1.1.483.874, doi:10.1007/978-3-540-73545-8_25, ISBN 978-3-540-73544-1.
In topological graph theory, an embedding (also spelled imbedding) of a graph G {\displaystyle G} on a surface Σ {\displaystyle \Sigma } is a representation...
In representation learning, knowledge graphembedding (KGE), also referred to as knowledge representation learning (KRL), or multi-relation learning,...
Such a drawing is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to...
A planar graph is a graph that has such an embedding onto the Euclidean plane, and a toroidal graph is a graph that has such an embedding onto a torus...
topological graph theory is a branch of graph theory. It studies the embedding of graphs in surfaces, spatial embeddings of graphs, and graphs as topological...
of embedding of the graph G, so it is a property of plane graphs (graphs that are already embedded in the plane) rather than planar graphs (graphs that...
Euclidean space in such a way that no two cycles of the graph are linked. A flat embedding is an embedding with the property that every cycle is the boundary...
any three-dimensional embedding of K7 contains a Hamiltonian cycle that is embedded in space as a nontrivial knot. Complete graphs on n {\displaystyle n}...
In graph theory, a book embedding is a generalization of planar embedding of a graph to embeddings in a book, a collection of half-planes all having the...
the output of a planarity testing algorithm may be a planar graphembedding, if the graph is planar, or an obstacle to planarity such as a Kuratowski...
of graph theory, a cubic graph is a graph in which all vertices have degree three. In other words, a cubic graph is a 3-regular graph. Cubic graphs are...
another instance GraphembeddingEmbedded generation, a distributed generation of energy, also known as decentralized generation Self-embedding, in psychology...
graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject...
a graph drawing represents a graph embedding. However, nonplanar graphs frequently arise in applications, so graph drawing algorithms must generally allow...
This is the embedding given by the hemi-dodecahedron construction of the Petersen graph (shown in the figure). The projective plane embedding can also be...
a graphembedding in the plane. The impossibility of the puzzle corresponds to the fact that K 3 , 3 {\displaystyle K_{3,3}} is not a planar graph. Multiple...
based methods. Graphembeddings also offer a convenient way to predict links. Graphembedding algorithms, such as Node2vec, learn an embedding space in which...
In graph drawing and geometric graph theory, a Tutte embedding or barycentric embedding of a simple, 3-vertex-connected, planar graph is a crossing-free...
must be an order embedding. However, not every order embedding is a coretraction. As a trivial example, the unique order embedding f : ∅ → { 1 } {\displaystyle...
from the graph, allowing holes through which the rest of the embedding can be seen. Ribbon graphs are also called fat graphs. In a ribbon graph representation...
outerplanarity. A 1-outerplanar embedding of a graph is the same as an outerplanar embedding. For k > 1 a planar embedding is said to be k-outerplanar if...
associated graph is a 3-connected graph that is not a cycle or dipole. The R stands for "rigid": in the application of SPQR trees in planar graphembedding, the...
Global Information
![{\displaystyle [0,1]}](https://wikimedia.org/api/rest_v1/media/math/render/svg/738f7d23bb2d9642bab520020873cccbef49768d)
