Lecture 3 (Computation Theory) Graph Theory and Finite Automata

By the definition given in lecture, a graph G is an ordered pair (V, E) where:

1. A.V is a non-empty finite set and E is a set of two-element subsets of V
2. B.V is any set of integers and E is the union of V with itself
3. C.V is a relation on E and E is a non-empty finite set
4. D.V and E are both two-element subsets of the natural numbers