Suggested practice problem

Chapter 10 Graphs

Problem 1:
For the Graphs shown in Figure-1:
a) Write down the set of vertices V and edges E for the graph G = (V, E) shown In Figure-1(a).
b) Find the degree of each vertex for the graph G = (V, E) given in Figure-1(b).

Figure-1:

Solution-a:
For G = (V, E),
V = {A, B, C, D, E}
E = [{A, B}, {A, C}, {A, D}, {B, C}, {B, E}, {C, D}, {C, E}]
Note: For undirected graph {x, y} = {y, x}, i.e., vertices x and y are connected by an edge (incidence).

Solution-b:
Since the degree of a vertex is equal to the number of edges to which it belongs; therefore,
Deg(A) = 2, Deg(B) = 3, Deg(C) = 3, Deg(D) = 2, Deg(E) = 4, and Deg(F) = 2.
Problem 2:
Consider the graph G in Figure-2. Find:

Figure-2:

Solution:
Problem 3:
Consider the multigraphs given in Figure-3:

Figure-3:

Solution:

Problem 4:

Figure-4:
Solution:

Problem 5:

Solution:

Figure-5:
Problem 6:
Find the adjacency matrix (AG) for the directed graph G = (V, E) given in Figure-6.

Figure-6:

Solution:

Problem 7:

Figure-7:

Solution:
Problem 8:
Is the C6 shown in Figure 8 bipartite?

Figure-8:
Solution:

Problem 9:
Draw a graph with the following adjacency matrix:

Solution:

Figure-9:
Problem 10:
What are the chromatic numbers of the graphs G and H shown in Figure 10?

Figure-10:

Problem 11:
 Figure-11:

Problem 12:
In scheduling final exams for summer school at Central High, six different tests have to be given to seven
students. The table below shows the exams that each of the students must take.

Exams Amy Ben Charles Debra Ed Frank Georgia

Math X X X X
Art X X X
Science X X X
History X X
French X X
Reading X X X X X

a) Draw a graph that illustrates exams which have students in common with other exams.

Solution:

Figure-12:

b) What is the minimum number of time slots that will be needed to schedule the six exams? Which
exams should be given in each of these time slots?
Solution:

It needs 3 time slots. The minimum number of time slots corresponds to the chromatic number of the
above graph. Since the graph contains a triangle (Math, Reading, Science is one), no less than three
colors will do. The coloring given above shows that it can be done in three colors, so the chromatic
number of the graph is 3. In the "black" time slot, Math and Art can be given, in the "red" time slot,
Reading and History and in the "blue" time slot, French and Science.

Problem 13:
Does each of these lists of vertices form a path in the graph shown in Figure 13? Which paths are simple?
Which are circuits? What are the lengths of those that are paths?

Figure-13:
Solutions:

Problem 14:
For the graphs show in Exercises 14(a)~(c), determine whether the given graph is connected or not.
 (a) (b) (c)
Figure-14:

Solutions:
a) This graph is not connected. It has three components.
b) This graph is connected.
c) This graph is not connected. There is no path from the vertices in one of the triangles to the
vertices in the other one.

Problem 15:

Solution:
Problem 16:
For the graphs shown in graphs shown in Figure 15(a)-(c), determine whether the given graph has an
Euler circuit. Construct such a circuit when one exists. If no Euler circuit exists, determine whether the
graph has an Euler path and construct such a path if one exists.

(a) (b) (c)

Figure-15:

Solution:
a)

b)

c)

Problem 17:
For each of the graph shown Figure 16, determine
(i) whether Dirac’s theorem can be used to show that the graph has a Hamilton circuit,
(ii) whether Ore’s theorem can be used to show that the graph has a Hamilton circuit, and
(iii) whether the graph has a Hamilton circuit.
 Figure-16:
Solution:

Problem 18:
Does the graph given in Figure 17 has a Hamilton path? If so, find such a path. If it does not, give an
argument to show why no such path exists.
 Figure-17:
Solution:

--------- End ----------