Graph Theory Homework for Engineers
Uploaded by
ScribdTranslationsGraph Theory Homework for Engineers
Uploaded by
ScribdTranslationsESPITA A.U.
: 2019-2020
Homework
Graph theory
1eraEngineer Year
Teacher: Atef KHEDHER
Note: This assignment will be graded and considered as a final exam.
The deadline for submitting responses is May 27.
Exercise 1
A travel agency organizes tourist excursions for 9 cities rated A, B, C, D, E,
F, G, H, and I each have different characteristics. We have represented this with the following graph.
below the different sites. An edge between two vertices coincides with the existence of a
path between the two peaks.
Is this graph connected? Justify.
2. Is this graph complete? Justify.
3. Provide in a table the degree of each vertex
A group of tourists wants to visit the 9 cities passing through each one only once.
each route. Is it possible to fulfill their wish:
a) Starting the visit at any site?
b) Starting the visit at site G? In that case, if the answer is
positive, what will be the last visited area.
The group wishes to associate each vertex with a color so that the vertices connected by
A path does not have the same color. We note the chromatic number of the graph.
5. Find a bound for the chromatic number c of this graph.
6. Propose a coloring of the graph to determine its chromatic number.
7. In order to reduce travel time on the roads, the travel agency wishes to seek to
visit all the sites starting from site A by taking the shortest path to
each site. Determine these paths.
1
Exercise 2
Let the directed graph described by the following incidence matrix:
1 2 3 4 5 6 7 89 10
A 11 10 0 0 0 0 0 0
B 0 0 01 11 0 0 0 0
C 0 01 0 0 1 11 0 0
D 0 1 0 01 0 0 0 1 1
E 0 0 0 1 0 01 0 01
F 1 0 0 0 0 1 1 0
1. Represent the graph
2. Determine the adjacency matrix of this graph
3. Determine the outgoing and incoming degree of each vertex
4. Give the list of successors and predecessors of each vertex.
5. Find the transitive closure of order 3 of this graph
Exercise 3
Consider the following directed graph
1. Determine the adjacency matrix of this graph
2. Determine the outgoing and incoming degree of each vertex
3. Give the list of successors and predecessors of each vertex.
4. Find the shortest path from E to S.
