GRAPH THEORY
edge between each pair of distinct vertices.
 Applied by the Swiss mathematician Leonhard
Euler to solve an old recreational puzzle in the
early eighteen centuries.
 Referred to as the “geometry of position”
 Used to analyze and solve a variety of
problems, such as determining whether or not it
is possible for a vehicle to traverse all trails
exactly once and return to the starting point
without repeating any trail in a trip.
GRAPH
 A generalization of the simple concept of a set
of points called vertices or nodes, and line
segments or curves called edges that connect
the vertices.
LOOP
 A loop is an edge whose endpoints are equal
i.e., an edge joining a vertex to itself is called a
loop.
MULTIPLE EDGES
 Two or more edges joining the same pair of
vertices.
SIMPLE GRAPH
 A graph with no loops and no multiple edges.
 Can be directed or undirected graph
DIRECTED GRAPH
 Set of vertices and set of edges that are
ordered pair of elements
PATH
 An alternating sequence of vertices and edges
*A graph is connected if there is a path connecting
all the vertices*
*If a path begins and ends with the same vertex, it
is a closed path or a circuit/cycle*
*Two vertices are adjacent if there is an edge
joining them*
*If every pair of vertices of a graph are adjacent,
the graph is complete*
COMPLETE GRAPH
 Is the simple graph that contains exactly one
*The degree of a vertex is the number of edges
attached to it*
BIPARTITE GRAPHS
 In a simple graph, it can be partitioned into two
disjoint sets such that every edge in the graph
connects a vertex (so that no edge connects
either two vertices or two vertices)
COMPLETE BIPARTITE GRAPHS
 is the graph that has its vertex set portioned into
two subsets of m and n vertices, respectively
There is an edge between two vertices if and
only if one vertex is in the first subset and the
other vertex is in the second subset.
*A subgraph is a subset of a given graph*
EULER CIRCUITS AND PATHS
 helped solve the Bridges of Königsberg
puzzle, a path that uses each edge of a graph
exactly once and ends at the starting vertex is
called an Eulerian circuit.
 f a connected graph had exactly two odd
vertices, it was possible to use each edge of the
graph exactly once but to end at a vertex
different from the starting vertex. Such a path is
called an Eulerian path.
EULER PATH/EULERIAN TRAIL/EULERIAN
WALK
 Is a path that uses each edge precisely once. If
such a path exists, the graph is called
traversable.
EULER CIRCUIT/EULERIAN CYCLE/EULERIAN
TOUR
 Is a closed path or circuit that uses each edge
precisely once. The path may cross through
vertices more than once. For an Euler circuit to
exist, the degree of each vertex in the graph
must be even. Hence, such a graph is called
Eulerian.