Complete Graphs

A undirected graph G = ? V, E ? is complete provided

(? (v, w) ? V ? V such that v ? w), {v, w } ? E.

c

a

b

d

e

K5

Previous slide

Next slide

Back to first slide

View graphic version