Graph Theory Applications in Mathematics
Uploaded by
ScribdTranslationsGraph Theory Applications in Mathematics
Uploaded by
ScribdTranslationsNUMBER THEORY
Unit 3: Graphs and Trees
FOR
GROUP
551120_
TUTOR:
Janeth Franco
NATIONAL OPEN AND DISTANCE UNIVERSITY UNAD
Bachelor's degree in Mathematics
May 2018
Unit 3: Graphs and Trees
Some activities where graph theory is used are:
Project planning
One of the first computer applications of graphs was related to the
project planning. A graph with directed edges is a natural way of
describe, represent and analyze complex projects consisting of many activities
related to each other.
Traffic systems
A frequently used tool by those who do urban planning and
transport is the computer simulation of traffic systems. The systems that
they model from national traffic networks to the streets of a city, going through
through certain urban areas and even reaching the existing traffic on a certain bridge or
road intersection. The models are used to highlight black spots
current or future, and to suggest and test proposed changes or new systems. For
For example, in a city, the street system can be modeled as a graph in which
the intersections are represented as vertices, and the existing street segments between intersections
they are the edges. Two-way streets are represented as undirected edges,
while one-way streets are represented by directed edges.
Computer networks
A more recent application of graphs is the modeling of computer networks.
the representation of a network through a graph, the computers or devices
Peripherals are represented by vertices, and the communication lines by the edges.
Graphs are an important tool that would allow us to model these networks with
the goal of, for example, improving its reliability, obtaining more efficient networks, etc.
Taken from [Link]
INITIAL QUESTIONS (Start Participation in the Collaborative Forum):
I. The topic of graph theory began in the year 1736 when the great mathematician
Leonhard Euler published a paper presenting the solution to the following
puzzle
The city of Königsberg in Prussia (now Kaliningrad in Russia) was built on a
point where two branches of the Pregel River come together. It consisted of an island and some
lands along the banks of the river. These were connected by seven bridges, as
shown in the figure. The question is: is it possible for a person to take a tour of the
city, starting and ending at the same location and crossing each one of the
Seven bridges exactly once?
In his original article, Euler did not need the path to start and end at the
same point. However, the analysis of the problem is simplified by the addition
of this condition. Later in this section, we analyze paths that begin and
they end at different points.
Taken from EPP, Susanna. “Discrete Mathematics with Applications”. Editorial
Cengage Learning. Mexico 2012 p. 642
II. Answer the following questions:
1) What can be said about two vertices in a rooted tree that have the same
ancestors?
What can be said about a vertex in a tree that has no ancestors?
3) What could I say about two vertices in a rooted tree that have a
common descendant?
1. Fill in the blanks with the correct word:
a) A graph consists of two finite sets: vertices and edges, where each edge
is associated with a composite set of arches
b) A loop in a graph isevery edge of the form (v, v).
c) Two distinct edges in a graph are parallel if and only if, ____.
Two vertices are called adjacent if and only if they are connected by an edge.
An edge is incident on two vertices of a graph.
f) Two edges that meet at the same endpoint are loops.
A vertex that has no incident edges is an isolated vertex.
In a directed graph, each edge is associated with arcs.
i) A complete graph with n vertices is a simple graph.
j) A complete graph of n vertices is a regular graph
2. For each of the graphs in the following exercises:
a) Determine all the edges that incident on 1.
b) Find all the vertices adjacent to 3 .
c) Determine all the loops.
d) Find all edges adjacent to 1 .
e) Find all the parallel edges.
f) Find all the isolated vertices.
g) Determine the degree of 3 .
h) Find the total degree of the graph.
Graph 1 Graph 2
a) Determine all
the edges that The edges that impact on The edges that impact on
they occur in 1 .
1 1, 2, 3 1 5, 4, 3
b) Find all
the vertices
adjacent to 3 . The vertices adjacent to The vertices adjacent to
3 6, 7 3 , 3, 4 5, 7
c) Determine all
the loops. The loops are 1, 3 The loops are 6, 7
d) Search for all the
adjacent edges The edges that are related The edges that are related in
a 1. in 1 : 1 1 1, 5
e) Find all
the edges The parallel edges The parallel edges
parallels. son 4 , 5 son 4 , 5 8, 9
f) Find all
the vertices
isolated. The isolated vertex is 4 The isolated vertex is 6
g) Determine the
degree of 3 . In this graph, the degree of
In this graph the degree of 3= 5
3= 2
h) Find the The degree of this graph is 14
The degree of this graph is 20
total grade of and is determined by the And it is determined by the number of edges
graph. number of edges
multiplied by 2
multiplied by 2
3. Draw the graph that satisfies:
a) The graph G has the set of vertices{ 1 , 2 , 3 , 4 , 5 } and the set of edges
{ 1 , 2 , 3 , 4 }, with the edge-vertex function defined as follows:
Graph G:
b) The graph H has the set of vertices{ 1 , 2 , 3 , 4 , 5 } and the set of edges
{ 1 , 2 , 3 , 4 }, with the extreme point-edge function defined as follows:
Graph H:
4. Solve the following exercises.
a) Find the directed graphs that have the following adjacency matrices.
b) Determine the adjacency matrices for the following graphs (undirected).
5. Respond according to the tree.
a) Find the parents of c and h.
RTA: The parents ofCesAy parents ofHesC
b) Find the ancestors of c and j.
RTA: Ancestor deCesAY ancestor deJesF, ByA
c) Find the children of d and f.
RTA: Children of DesI y sons of FesJ
d) Find the descendants of l.
RTA: Ino has descendants
e) Find the siblings of D and G.
RTA: Brothers of DesEyFy brothers of GesH
f) Find the terminal vertices.
RTA: Terminal vertices: I, E, J, G, K, L. (they have no children)
g) Find the internal vertices.
RTA: Internal vertices: A, B, D, F, C, H.
6. Find the adjacency matrices for the following graphs:
7. Find the adjacency matrices for the following graphs:
A)
Directed graph matrix:
01 1
{10 0 }
0 0 0
B)
Directed graph matrix
10 10
{ 0 0 10 }
10 0 1
0 0 10
8. Determine if each pair of graphs is isomorphic:
a)
( ){= 1, 2, 3, 4, }5
( ){(= 1, 2 )(1 , 5 )(
2, 3 3 ,)( 4 4, )(5 )}
( ∗
{)= 1, 2, 3, 4, 5}
( ∗
{(
)= 1, 3 )(1 , 4 2)(
, 4 2 , )( 5 3, )(5 )}
Let's see if every edge of G is an edge. ∗ after applying the function F.
∗)
The edge (1 , 2∈) a (y ) ( 1) , ( 2) =( 1, 3) also∈ a (
∗)
The edge (1 , 5∈) a (y ) ( 1) , ( 5) =( 1, 4) also∈ a (
∗)
The edge (2 , 3∈) a (y ) ( 2) , ( 3) =( 2, 4) also∈ a (
∗)
The edge (3 , 4∈) a (y ) ( 3) , ( 4) =( 2, 5) also∈ a (
∗)
The edge (4 , 5∈) a (y ) ( 1) , ( 2) =( 3, 5) also∈ a (
Up to this point we have tested that if it is an edge of G then it is also a
pinnacle of ∗ Now we must prove the reciprocal using the inverse of the function. ,
that is to say -1
The edge 1, 3) ∈a ( y∗) ( -1),
1 ( -13 )= ( 1, 3) also∈ a ( ∗)
The edge 1, 4) )∈a ( y∗) ( -1
1 ), ( -1 )=
4 ( 1, 5) also∈ a ( ∗)
The edge 2, 4) ∈a ( y∗) ( -1),
2 ( -14 )= ( 2, 3 also∈ a ( ∗)
The edge 2, 5) ∈a ( y∗) ( -1),
2 ( -15 )= ( 3, 4 also∈ a ( ∗)
The edge 3, 5) ∈a ( y∗) ( -1),
3 ( -15 )= ( 4, 5) also∈ a ( ∗)
( ){= 1, 2, 3, 4, }5
( ){(= 1, 2 )(1 , 3 )(
1, 4 1 ,)( 5 2, )(3 3, 4)( 3 , 5 )(4 , 5 )( )}
( ∗
{)= 1, 2, 3, 4, 5}
( ∗
{(
)= 1, 2 )(1 , 5 2)(
, 3 2 , )( 4 2, )(5 3, 4)( 4 , 5 )( )}
Graphs cannot be characterized as isomorphic, because, although they have 5
vertices do not have the same edges.
9. The following is an adjacency matrix for a graph:
Answer the following questions by examining the
matrix and its powers, do not draw the graph:
