Graph (topology)

In topology, a subject in 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 $[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.^[1]

Thus, in particular, it bears the quotient topology of the set

X_{0}\sqcup \bigsqcup _{e\in E}I_{e}

(disjoint union)

under the quotient map used for gluing, where $X_{0}$ is the 0-skeleton (consisting one point for each vertex $x\in V$ ) and $I_e$ are the intervals ("closed one-dimensional unit balls") glued to it, one for each edge $e\in E$ .^[1]

The topology on this space is called the graph topology.^[2]

Subgraphs and -trees

A subgraph of a graph $X$ is a subspace $Y \subseteq X$ which is also a graph and whose nodes are all contained in the 0-skeleton of $X$ . $Y$ is a subgraph if and only if it consists of vertices and edges from $X$ and is closed.^[1]

A subgraph $T\subseteq X$ is called a tree iff it is contractible as a topological space.^[1]

Properties

Every connected graph $X$ contains a maximal tree $T\subseteq X$ , that is, a tree that is maximal with respect to the order induced by set inclusion on the subgraphs of $X$ which are trees.^[1]
If $X$ is a graph and $T\subseteq X$ a maximal tree, then the fundamental group $\pi _{1}(X)$ equals the free group generated by elements $(f_{\alpha })_{\alpha \in A}$ , where the $\{f_{\alpha }\}$ correspond bijectively to the edges of $X\setminus T$ ; in fact, $X$ is homotopy equivalent to a wedge sum of circles.^[1]
Forming the topological space associated to a graph as above amounts to a functor from the category of graphs to the category of topological spaces.^[2]
The associated topological space of a graph is connected (with respect to the graph topology) if and only if the original graph is connected.^[2]
Every covering space projecting to a graph is also a graph.^[1]

Applications

Using the above properties of graphs, one can prove the Nielsen–Schreier theorem.^[1]

References

1 2 3 4 5 6 7 8 Hatcher, Allen (2002). Algebraic Topology. Cambridge University Press. p. 83ff. ISBN 0-521-79540-0.
1 2 3 Michael Slone (8 May 2003). "graph topology". PlanetMath. Retrieved 1 February 2017.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[hatcher-1] 1 2 3 4 5 6 7 8 Hatcher, Allen (2002). Algebraic Topology. Cambridge University Press. p. 83ff. ISBN 0-521-79540-0.

[planetmath-2] 1 2 3 Michael Slone (8 May 2003). "graph topology". PlanetMath. Retrieved 1 February 2017.

Graph (topology)

Subgraphs and -trees

Properties

Applications

See also

References