Terms Related To Graph Theory: 1

For Kn, e = n (n-1) and for n ≥ 2, the degree is equal

 A loop is an edge connecting a vertex itself. 2
 If two vertices are connected by more than one to n – 1.
edge, these edge are called multiple edges.
 A graph with no loops and no multiple edges is Example:
called a simple graph. How many edges does a graph with 10 vertices have?
 A path is an alternating sequence of vertices and What is the degree of each vertex?
edges. It can be seen as a trip from one vertex to
another using the edges of the graph. Solution:
 A graph is connected if there is a path connecting 1
all the vertices. Kn, e = n (n-1)
2
 If a path begins and ends with the same vertex, it is 1
a closed path, or a circuit or cycle. Kn, e = 10 (10-1)
2
 Two vertices are adjacent if there is an edge
Kn, e = 45 edges
joining them.
 If every pair of vertices of a graph are adjacent, the
Degree = n – 1
graph is complete. A complete graph with n
= 10 – 1 = 9 (degree of each vertex)
vertices is denoted by Kn
 The degree of a vertex is the number of edges
Euler Paths and Circuits
attached to it.
 An Euler Circuit is a closed path (starts and ends at
the same vertex) that uses every edge, but never uses
Examples of Graphs
the same edge twice. The path may cross through
 Null or Disconnected Graph
vertices more than once.
The graph is null or
 Eulerian Graph Theorem – a connected graph is
disconnected since it has four
Eulerian if and only if every vertex of the graph is of
vertices but no edges. The
even degree.
degree of each vertex is zero.
 An Euler Path is a path that uses every edge in the
 Graph with a Loop
graph exactly once but it does not start and end at the
same vertex.
 A connected graph contains an Euler Path if and
only if the graph has two vertices of odd degrees with
all other vertices of even degrees. Furthermore, every
 Graph with Multiple Edges
path must start at one of the vertices of odd degrees
and end at the other.

Hamiltonian Paths and Circuits

 A Hamiltonian Path is a path that visits each vertex
Both graphs are connected and have a multiple edges of the graph exactly once.
connecting vertices A and B. The degrees of vertices A  A Hamiltonian Circuit is a path that uses each
and B in G1 are both 3 while that of G2 are both 4. vertex of a graph exactly once and returns to the
starting vertex.
Complete Graph  A graph that contains a Hamiltonian circuit is called
A complete graph is a connected graph in which every Hamiltonian.
possible edge is drawn between vertices. It should not
contain multiple edges. In Euler circuits, closed paths use every edge exactly
once, possibly visiting a vertex more than once. On
contrary, in Hamiltonian circuits, paths visit each vertex
exactly once. But unlike the Euler Circuit , where the
Eulerian Graph Theorem is used to determine whether it
contains an Euler circuit or not, there is no
straightforward criterion to determine whether or not a
Hamilton circuit exists in a graph.
Let e be the number of edges in a complete graph. From
the previous examples of complete graphs, we have In some graphs, the following theorem can help identify
identified that … if a graph is Hamiltonian:
K1: e = 0, degree of the vertex is 0 - Consider a connected graph with at least 3
K2: e = 1, degree of the vertex is 1 vertices and no multiple edges. Let n be the
K3: e = 3, degree of the vertex is 2 number of vertices in the graph. If every vertex
K4: e = 6, degree of the vertex is 3 n
has degree of at least , then the graph ‘must
2
be’ Hamiltonian.