Graphs

Simple Graphs

Definition: A simple (undirected) graph G = (V, E) consists of a non-empty set of
vertices V and set E of unordered pairs of distinct vertices of V called edges.

Hamilton Path

Definition: A path in a simple graph G is a simple path that contains every vertex in V exactly once

R1 ∪ R2 where R1 and R2 are regular expressions

R1 ◦ R2 = R1R2 where R1 and R2 are regular expressions