Topological graph
In mathematics, a topological graph is a representation of a graph in the plane, where the vertices of the graph are represented by distinct points and the edges by Jordan arcs (connected pieces of Jordan curves) joining the corresponding pairs of points. The points representing the vertices of a graph and the arcs representing its edges are called the vertices and the edges of the topological graph. It is usually assumed that any two edges of a topological graph cross a finite number of times,no edge passes through a vertex different from its endpoints, and no two edges touch each other (without crossing). A topological graph is also called a drawing of a graph.
Link from a Wikipage to another Wikipage
primaryTopic
Topological graph
In mathematics, a topological graph is a representation of a graph in the plane, where the vertices of the graph are represented by distinct points and the edges by Jordan arcs (connected pieces of Jordan curves) joining the corresponding pairs of points. The points representing the vertices of a graph and the arcs representing its edges are called the vertices and the edges of the topological graph. It is usually assumed that any two edges of a topological graph cross a finite number of times,no edge passes through a vertex different from its endpoints, and no two edges touch each other (without crossing). A topological graph is also called a drawing of a graph.
has abstract
In mathematics, a topological ...... , drawings without crossings).
@en
Wikipage page ID
37,439,184
page length (characters) of wiki page
Wikipage revision ID
1,021,541,674
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
comment
In mathematics, a topological ...... o called a drawing of a graph.
@en
label
Topological graph
@en