MODULE SIX PROBLEM SET
This document proprietary Southern New Hampshire University. is to It and
the problems within may not posted any non-SNHU website.be on
Jacqueline Amoah
1
Directions: Type your solutions into this document sure show all steps and be to
for arriving at your solution. Just giving a final number may not receive full credit.
P
ROBLEM
1
For parts (a) (b), indicate each the two graphs are equal. Justify your and if of
answer.
(a)
Figure 1:
Left: undirected graph has 5 vertices. The vertices are An
arranged in the form of an inverted pentagon. From the top left vertex,
moving clockwise, the vertices are labeled: a, b, c, d, and e. Undirected
edges, line segments, are between the following vertices: a and b; a and c;
b c and c; and e e d; and d; and and c.
Figure 2:
Right: The adjacency list representation of a graph. The list
shows all the vertices, a through e, in a column from top to bottom. The
adjacent vertices for each vertex in the column are placed in a row to the
right of the corresponding vertex’s cell in the column. An arrow points from
each cell the column its corresponding row the right. Data from in to on
the list, as follows: Vertex a is adjacent to vertices b and c. Vertex b is
adjacent to vertices a and c. Vertex c is adjacent to vertices a, b, d, and e.
Vertex d adjacent vertices c is to and e. Vertex e adjacent vertices c is to
and d.
The
provided
adjacency
list
tells
us
which
vertices
are
connected
together.
The
graph
that
corresponds
to
this
adjacency
list
will
look
like
this
and
this
graph
is
equal
to
the
one
that
is
present
on
the
left
in
the
question.
Therefore,
the
2
graphs
are
considered
to
be
equal.
(b)
0
0
Figure 3:
An undirected graph has 5 vertices. The vertices are arranged in
the form of an inverted pentagon. Moving clockwise from the top left vertex
a, b, d, and the other vertices are, c, e. Undirected edges, line segments,
are between the following vertices: a and a e c; and d; d and c; and and b.
The
provided
adjacency
matrix
tells
us
whether
an
edge
is
present
