graph topology
A graph is identified by its vertices and itsedges . A graph also admits a naturaltopology, called the graph topology, by identifying every edge with the unit interval and gluing them together atcoincident vertices.
This construction can be easily realized in the framework of simplicialcomplexes. We can form a simplicial complex . And the desired topological realization of the graph is just thegeometric realization of .
Viewing a graph as a topological space has several advantages:
- •
The notion of graph isomorphism
becomes that of simplicial (or cell) complex (http://planetmath.org/CWComplex) isomorphism
.
- •
The notion of a connected graph
coincides with topologicalconnectedness (http://planetmath.org/ConnectedSpace).
- •
A connected graph is a tree if and only if its fundamental group
is trivial.
Remark:A graph is/can be regarded as a one-dimensional -complex.
Title | graph topology |
Canonical name | GraphTopology |
Date of creation | 2013-03-22 13:37:03 |
Last modified on | 2013-03-22 13:37:03 |
Owner | mps (409) |
Last modified by | mps (409) |
Numerical id | 10 |
Author | mps (409) |
Entry type | Definition |
Classification | msc 54H99 |
Classification | msc 05C62 |
Classification | msc 05C10 |
Synonym | one-dimensional CW complex |
Related topic | GraphTheory |
Related topic | Graph |
Related topic | ConnectedGraph |
Related topic | QuotientSpace |
Related topic | Realization |
Related topic | RSupercategory |
Related topic | CWComplexDefinitionRelatedToSpinNetworksAndSpinFoams |