Discrete Math Final

Bipartite Graphs

• No odd length cycles

• Vertices A, B

• A —>B (correct)

• A - ->A x (wrong)

• B - ->B x (wrong)

Wheel Graph

Created by taking Cn-1 and adding a new vertex connected to all n-1 vertex in cycle.

Complete Graph

Kn

• Every vertex is connected to every other vertex

Isomorphic

• 2 Graphs

• Same # of vertex

• Same # of edges

• Same connections

Directed Graphs

Consists of vertices V and set of directed edges E also know as arcs.

Planarity