Please enable JavaScript.
Coggle requires JavaScript to display documents.
Graph theory - Coggle Diagram
Graph theory
Basic terms
vertices
edges
V+F = E+2
faces
types of connections
loop
: starts and ends with same vertex
adjacent vertex
- connected by one edge
multiple edges
- more than 1 edge connecting the same two vertices
simple
digraphs/weighted graphs: - no loops and no multiple edges
walk
open vs closed (cycle)
trail (no repeated edges)
path (no repeat edge AND no repeat vertices)
length (number of edges)
undirected / directed
undirected
connections
bridge -> if removed, disconnects
connected vs disconnected
complete graphs (Kn)
directed graphs (digraphs) (e.g. who visited another's house)
weighted graphs/networks (e.g. distance)
planar graphs
- can be drawn in a plane without edges crossing over