Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Graph Theory
Supplements
Course Overview (3:24)
TextBook Recommendations (2:21)
Tools and Softwares (5:26)
Sets (8:38)
Number Sets (10:07)
Parity (12:24)
Terminologies (7:15)
Fundamentals
Graphs Intro (2:45)
Graphs (11:25)
Subgraphs (8:32)
Degree (9:52)
Sum of Degrees of Vertices Theorem (23:22)
Adjacency and Incidence (9:15)
Adjacency Matrix (16:16)
Incidence Matrix (8:04)
Isomorphisms (8:23)
Paths
Intro (0:36)
Walks, Trails, Paths, and Circuits (12:35)
Examples (10:18)
Eccentricity, Diameter, and Radius (6:47)
Connectedness (20:03)
Euler Trails and Circuits (17:36)
Fleury’s Algorithm (10:15)
Hamiltonian Paths and Circuits (5:46)
Ore's Theorem (14:08)
Dirac's Theorem (6:05)
The Shortest Path Problem New New (15:57)
Graph Types
Intro (0:32)
Trivial, Null, and Simple Graphs (9:29)
Regular Graphs (9:35)
Complete, Cycles and Cubic Graphs (10:01)
Path, Wheel and Platonic Graphs (10:34)
Bipartite Graphs (14:15)
Trees
Intro (0:31)
Trees (14:02)
Cayley's Theorem (2:59)
Rooted Trees (10:24)
Binary Trees (13:46)
Binary Tree Traversals (18:04)
Binary Expression Trees (8:54)
Binary Search Trees (BST) (19:23)
Spanning Trees (10:01)
Forest (7:28)
Digraphs and Tournaments
Intro (0:20)
Digraphs (11:58)
Degree Digraph (9:07)
Isomorphism Digraphs (7:30)
Adjacency Matrix Digraphs (10:16)
Incidence Matrix Digraph (4:50)
Walks, Paths and Cycles Digraphs (12:06)
Connectedness Digraph (5:22)
Tournaments (7:47)
Planar Graphs
Intro (0:21)
Planar Graphs (9:52)
Kuratowski's Theorem (14:05)
Euler's Formula (10:26)
Dual Graphs (10:55)
Graph Operations
Intro (0:35)
Vertex and Edge Deletion (7:32)
Cartesian Product (9:46)
Graph Join and Transpose (4:01)
Complement Graphs (5:17)
Graph Colorings
Intro (0:21)
Vertex Colorings (5:26)
Edge Colorings (8:43)
Total Colorings (5:24)
Trivial, Null, and Simple Graphs
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock