13432289
Description
Mind Map by Luke Byrne, updated more than 1 year ago
|
|
Created by Luke Byrne
over 6 years ago
|
|
Graph Theory
- Terminology
- Undirected Graph
- Vertices (V)
- Trivial: 1V & 0E
- Trivial: 1V & 0E
- Edges (E)
- Incidence
- Vertex, v, is called incident to the edge, e, if e = vv' (v' for another vertex)
- Vertex, v, is called incident to the edge, e, if e = vv' (v' for another vertex)
- Vertices (V)
- Undirected Graph
- Isomorphisms of Graphs
- Subgraphs
- Vertex Degrees
- Walks, Trails and Paths
- Walks
- Trails
- Eulerian
- Eulerian
- Paths
- Hamiltonian
- Hamiltonian
- Circuits
- Eulerian
- Hamiltonian
- Forests and Trees
- Eulerian
- Walks
- Graph Components
- Graph Types
- Complete Graphs
- Bipartite Graphs
- Connected Graphs
- Complete Graphs
Want to create your own Mind Maps for free with GoConqr? Learn more.