Graph Theory Fundamentals

Related lectures (29)

Page 2 of 3

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

Introduces the basics of graphs and networks, covering definitions, paths, trees, flows, circulation, and spanning trees.

Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.

Covers the fundamentals of handling networks and centrality measures in graph theory.

Distinguishes between subgraphs and induced subgraphs in graph theory, illustrating the construction of minimal spanning trees.

Explores coordination among agents in networked control systems through graph theory and real-world examples.

Explores automorphisms of graphs, focusing on automorphism groups, Cayley-Abels graphs, and quasi-isometry.

Covers sparsest cut, NP-completeness, Bougains Theorem, and concurrent flow in graphs.

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

Explores graph theory concepts, centrality measures, and real-world network properties, providing insights into handling diverse types of networks.