Zusammenfassung der Ressource
Graph Theory
- Terminology
- Undirected Graph
- Vertices (V)
- Trivial: 1V & 0E
- Edges (E)
- Incidence
- Vertex, v, is called incident to the edge, e, if e = vv' (v' for another vertex)
- Isomorphisms of Graphs
- Subgraphs
- Vertex Degrees
- Walks, Trails and Paths
- Walks
- Trails
- Eulerian
- Paths
- Hamiltonian
- Circuits
- Eulerian
- Hamiltonian
- Forests and Trees
- Graph Components
- Graph Types
- Complete Graphs
- Bipartite Graphs
- Connected Graphs