Multiple edges

Related lectures (27)

Page 2 of 3

Explores a classic handshake problem at a party using graph representation.

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

Explores the Cartesian product operation on graphs and introduces the concept of cubes.

Covers soft graphs and induced subgraphs in graph theory.

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

Covers the concept of adjacency matrix and adjacency lists for representing networks.

Covers linear programming duality and complementary slackness condition.

Covers the basics of graph algorithms, focusing on modeling and representation of graphs in memory.

Covers variational inference and neural networks for classification tasks.

Covers bipartite and n-partite graphs, including complete graph definitions and examples.