
10-70 Discrete Mathematical Structures
17. Draw the graph of the adjacency matrix
A
v
v
v
v
=
1
2
3
4
10
12
12
18. Consider the graph G given below. Find which of the following sequences of vertices are
simple paths, walks, and circuits.
(i) (A, B, C, F)
(ii) (A, B, C, F, E, D, A)
(iii) (A, B, F, E, D, B, A)
(iv) (A, B, F, E, D)
(v) (D, E, F, C, B, D)
19. List all circuits in the graph that begin at vertex 1.
20. Can there be a graph that has (i) three vertices with degrees 2, 3, and 4? (ii) Four vertices
of degrees 2, 2, 2, 2. (iii) There are four vertices v
1
, v
2
, v
3
, and v
4
with degrees 4, 5, 2, and
5, respectively. ...