Relations
- Equivalence relation - reflexive, symmetric, transitive
- Partial order - reflexive, anti-symmetric, transitive
- Full order - partial order and
Examples or orders include
Function
- Injective -
- Surjective -
- Bijective - injective and surjective
Undirected graph
Directed graph
Multi-graph
Graph traversals
- Walk - edges and vertices can be reused
- Path (or trail) - edges cannot be reused, vertices can be reused
- Simple path (or path if using trail terminology) - edges and vertices cannot be reused
Connectivity
- Connected graph is a graph with a path between any two vertices
- Strongly connected graph is a directed graph with a directed path between any two vertices in both directions
- Weakly connected graph is a “not strongly connected” directed graph
- Graph diameter is the length of a largest path out of the shortest paths between any two vertices