Scribd
Upload
11 views

The-Mathematics-of-Graphs

galwkgjprg

Uploaded by

Dracule Mihawk
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
11 views

The-Mathematics-of-Graphs

galwkgjprg

Uploaded by

Dracule Mihawk
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 30

The

Mathematics
of Graphs
Graphs
Graph
•Agraph is a collection of
points called vertices or
nodes and line segment or
curves called edges that
connect the vertices.
Graph
•Graphs can be used to illustrate
huge connections such as social
networks in Facebook, flight
destinations of airlines, the
simple community garbage
collection route, or even the
computer system connectivity in
Example: Constructing a Graph
The following table lists eleven cities connected by
Cebu Pacific airline flights.
1 Draw a graph that presents this
information where each vertex represents
a city and an edge connects two vertices if
the two cities have a direct flight.

2 Use your graph to determine which city


has the most and least number of direct
flights.
Definitions
•A loop is the edge connecting a vertex
to itself.
• If
two vertices are connected by more
than one edge, these edges are called
multiple edges.
•A graph with no loops and no multiple
edges is called a simple graph.
Definitions
•A path is an altering sequence of
vertices and edges. It can be seen as a
trip from one vertex to another using the
edges of the graph.
•Agraph is connected if there is a
path connecting all the vertices .
Definitions
• If a path begins and ends with the same
vertex, it is called a closed path or a
circuit or cycle.
• Two vertices are adjacent if there is an
edge joining them.
Definitions
• If
every pair of vertices of graph are
adjacent, the graph is complete. A
complete graph with n vertices is
denoted by Kn.
• Thedegree of a vertex is the number of
edges attached to it.
Examples of Graphs
• Nullor Disconnected Graph. The
graph below is a null or disconnected
graph since it has four vertices but no
edges. The degree of each vertex is 0.
Examples of Graphs
• Graphwith a Loop. The loop connects
vertex A to itself. The degree of a loop is
2.
Examples of Graphs
•Graph with Multiple Edges.
Both graphs G1 and G2 on the
next page are connected and
have multiple edges connecting
vertices A and B. The degrees of
vertices of A and B in G1 are both
equal to 3 while that of G2 are
Examples of Graphs
Examples of Graphs
Examples of Graphs
•Complete Graph. A
complete graph is a
connected graph in which
every edge is drawn between
vertices. It should not contain
multiple edges.
Examples of Graphs
Let e be the number of edges in a
•
complete graph. From the results above,
we find that for:
• K1: e = 0, degree of the vertex is 0.
• K2: e = 1, degree of the vertex is 1.
• K3: e = 3, degree of the vertex is 2.
• K4: e = 6, degree of the vertex is 3.
• K5: e = 10, degree of the vertex is 4.
Examples of Graphs
•What about Kn, a complete
graph with n vertices? How
many edges could we possibly
get and what is the degree of
each vertex in the graph? The
number of edges is equal to:
for n ≥ 3 while the degree of
each vertex is obviously
equal to n – 1
Euler Paths
and Circuits
Euler Circuits
•An Euler circuit is a closed
path that uses every edge,
but never uses the same edge
twice. The path may cross
through vertices more than
once.
Eulerian Graph Theorem
•Aconnected graph is Eulerian if
and only if every vertex of the
graph is of even degree.
• Note
that the Eulerian Graph Theorem only
guarantees that if the degrees of all
• the vertices in a graph are even, an Euler
Eulerian Graph
Theorem
•Note that the Eulerian Graph
Theorem only guarantees that
if the degrees of all the
vertices in a graph are even,
an Euler circuit exists, but it
does not tell us how to find
Eulerian Graph
Theorem
•Example 1: Determine whether
the following graph is Eulerian. If
it is, find an Eulerian circuit. If it is
not, explain why.
Euler Path
•AnEuler path is a path that uses
every edge in the graph exactly
once but it
does not start and end at the
same vertex.
Euler Path
• Example 2: Determine whether the
following graph is Eulerian. If it is,
find a Eulerian circuit. If it is not, can
you find an Euler path?

You might also like