Graphs 1

• Motivation

• Digraphs, Undirected graphs, graphs with self loops, weighted graphs

• Paths, cycles, connectedness, free trees, spanning trees, minimum spanning trees.

• Complete graphs, bipartite graphs.

Next slide

Back to first slide

View graphic version