Graph Theory
Explore graph structures; paths, coloring and planarity; networks and spectral viewpoints. Concepts and connections are available independently of video coverage.
FOLLOW AN IDEA
Graph Laplacian
For a simple undirected graph, degree matrix minus adjacency matrix encodes connectivity and diffusion.
Explore concept graph · Explore connected videos
Different ways to understand it
No reviewed video yet. Explore the concept in a map or suggest a resource. Suggest a video
More concepts to explore
Graph matchings
A matching is a set of edges with no shared endpoints.
Network flow models
Maximise flow through capacities; the min-cut theorem turns a bottleneck argument into a computable bound.
Vertex degrees
Degree counts incident edge ends; directed graphs distinguish incoming and outgoing degrees.
Graph coloring
Proper vertex coloring assigns different colors to adjacent vertices.
Graph connectivity
Paths determine connected components; vertex and edge connectivity quantify robustness to removal.
Knowledge connections
- Network flow models · Related · Map context
- Graph matchings · Related · Map context
- Vertex degrees · Prerequisite · Map context