Graph embedding

From Wikipedia, the free encyclopedia

This article is missing citations or needs footnotes. Please help add inline citations to guard against copyright violations and factual inaccuracies. (April 2008)

In topological graph theory, an embedding of a graph G on a surface Σ is a representation of G on Σ in which points of Σ are associated to vertices and simple arcs (homeomorphic images of [0,1]) are associated to edges in such a way that:

• the endpoints of the arc associated to an edge e are the points associated to the end vertices of e,
• 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 compact, connected 2-manifold.

Often, an embedding is regarded as an equivalence class (under homeomorphisms of Σ) of representations of the kind just described.

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.

If a graph G is embedded on a closed surface Σ, the complement of the union of the points and arcs associated to the vertices and edges of G is a family of regions (or faces). A 2-cell embedding is an embedding in which every face is homeomorphic to an open disk. A closed 2-cell embedding is an embedding in which the closure of every face is homeomorphic to a closed disk.

The genus of a graph is the minimal integer n such that the graph can be embedded in a surface of genus n. In particular, a planar graph has genus 0, because it can be drawn on a sphere without self-crossing.

The non-orientable genus of a graph is the minimal integer n such that the graph can be embedded in a non-orientable surface of (non-orientable) genus n.

Contents 1 Computational complexity 2 Embeddings of graphs of higher-dimensional manifolds 3 References 4 See also

[edit] Computational complexity

The problem of finding the graph genus is NP-hard (the problem of determining whether an n-vertex graph has genus g is NP-complete).^[1]

At the same time, the graph genus problem is fixed-parameter tractable, i.e., polynomial time algorithms are known to check whether a graph can be embedded into a surface of a given fixed genus as well as to find the embedding.

The first breakthrough in this respect happened in 1979, when algorithms of time complexity O(n^O(g)) were independently submitted to the Annual ACM Symposium on Theory of Computing: one by I. Filotti and G.L. Miller and another one by J. Reif. Their approaches were quite different, but upon the suggestion of the program committee they presented a joint paper.^[2]

In 1999 it was reported that the fixed-genus case can be solved in time linear in the graph size and doubly exponential in the genus.^[3]

[edit] Embeddings of graphs of higher-dimensional manifolds

It is known that any graph can be embedded into a three-dimensional space. The idea is simple. Pick a line in the space and place the vertices of a graph along this line an any order. Draw as many planes through the line as there are edges in the graph and embed each edge into an individual plane.

The above special case of embedding is called book embedding of the graph. This metaphor comes from imagining that each of the planes where an edge is drawn is like a page of a book. It was observed that in fact several edges may be drawn in the same "page". This gave rise to the following problem:

Find a book embedding of a graph with minimal number of pages.

[edit] References

[edit] See also

• Embedding, for other kinds of embeddings
• Book thickness
• Geometric thickness
• Graph thickness
• Rotation system, for a combinatorial representation of a 2-cell embedding of a graph in an orientable surface
• Doubly-connected edge list, a data structure to represent a graph embedding in the plane

This mathematics-related article is a stub. You can help Wikipedia by expanding it.