Your language?
May, 2019
Sun Mon Tue Wed Thu Fri Sat
1 2 3 4
5 6 7 8 9 10 11
12 13 14 15 16 17 18
19 20 21 22 23 24 25
26 27 28 29 30 31

Graphs

A graph consists of vertices and edges. And vertices are connected to each other by edges. From this point of view, graphs can be identified with 1-dimensional CW-complexes . As topological objects, graphs don’t look illuminating. Graphs are, however, useful when we describe combinatorial data mathematically. As a generalization of knot theory , we can study embeddings of graphs topologically. Ribbon graphs are also important in low-dimensional topology.

There are many variations. We can color vertices or edges. We can also orient edges. Directed graphs are called quivers .