Graph (topology)

In topology, a branch of mathematics, a graph is a topological space which arises from a usual graph G = (E, V) by replacing vertices by points and each edge e = xy \in E by a copy of the unit interval I = [0,1] , where 0 is identified…

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In topology, a branch of mathematics, a graph is a topological space which arises from a usual graph G = (E, V) by replacing vertices by points and each edge e = xy \in E by a copy of the unit interval I = [0,1] , where 0 is identified with the point associated to x and 1 with the point associated to y . That is, as topological spaces, graphs are exactly the simplicial 1-complexes and also exactly the one-dimensional CW complexes. Thus, in particular, it bears the quotient topology of the set : X_0 \sqcup \bigsqcup_{e \in E} I_e under the quotient map used for gluing.

Here X_0 is the 0-skeleton (consisting of one point for each vertex x \in V ), I_e are the closed intervals glued to it, one for each edge e \in E , and \sqcup is the disjoint union. The topology on this space is called the graph topology.

In topology, a branch of mathematics, a graph is a topological space which arises from a usual graph G = (E, V) by replacing vertices by points and each edge e = xy \in E by a copy of the unit interval I = [0,1] , where 0 is identified with the point associated to x and 1 with the point associated to y . That is, as topological spaces, graphs are exactly the simplicial 1-complexes and also exactly the one-dimensional CW complexes. Thus, in particular, it bears the quotient topology of the set X_0 \sqcup \bigsqcup_{e \in E} I_e under the quotient map used for gluing.

Here X_0 is the 0-skeleton (consisting of one point for each vertex x \in V ), I_e are the closed intervals glued to it, one for each edge e \in E , and \sqcup is the disjoint union. The topology on this space is called the graph topology.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1323512647 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001323512647 · captured 1763785933.0 · version history

Cite this page as: encyclopegia.org, “Graph (topology)”, snapshot enwiki-001323512647. https://encyclopegia.org/a/graph-topology

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.