Graph Theory Basics

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (30)

Page 1 of 3

Minimum Spanning Trees: Prim's Algorithm

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Spanning Trees: Definition and Applications

Introduces spanning trees in graphs and the Minimum Spanning Tree problem, exploring efficient algorithms for optimal decision-making.

Graph Theory and Network Flows

Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.

Graph Theory Fundamentals

Covers the fundamentals of graph theory, including vertices, edges, degrees, walks, connected graphs, cycles, and trees, with a focus on the number of edges in a tree.

Relations Between Events

Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.

Graph Algorithms II: Traversal and Paths

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Interlacing Families and Ramanujan Graphs

Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.

Expander Graphs: Properties and Eigenvalues

Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.

Interlacing Families and Ramanujan Graphs

Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.

Minimal Spanning Tree

Covers the concept of weighted graphs and the Greedy algorithm for finding a minimal spanning tree.