A. 0-1 0-2 0-3 1-3 1-4 2-5 2-9 3-6 4-7 4-8 5-8 5-9 6-7 6-9 7-8 B. 0-1 0-2 0-3 0-3 1-4 2-5 2-9 3-6 4-7 4-8 5-8 5-9 6-7 6-9 7-8 C. 0-1 1-2 1-3 0-3 0-4 2-5 2-9 3-6 4-7 4-8 5-8 5-9 6-7 6-9 7-8 D. 4-1 7-9 6-2 7-3 5-0 0-2 0-8 1-6 3-9 6-3 2-8 1-5 9-8 4-5 4-7Which of these graphs are isomorphic to one another?
2.
Show, in the style of Figure 18.11,
the DFS forest that results from a standard adjacency-matrix DFS
of the graph
0-1 1-2 1-7 2-0 2-4 3-2 3-4 4-5 4-6 4-7 5-3 5-6 7-8 8-6 8-7
3.
Give the vertex connectivity and the edge connectivity of the graph
in the previous question.
4.
Show, in the style of Figure 19.9,
the DFS forest that results from a standard adjacency-lists DFS
of the digraph
0-1 1-2 1-7 2-0 2-4 3-2 3-4 4-5 4-6 4-7 5-3 5-6 7-8 8-6 8-7
5.
Give the transitive closure of the digraph in the previous question.
Also, identify the strong components and draw the kernel DAG.
6.
[Exercise 19.103]
Show, in the style of Figure 19.26, the process of topologically sorting
with the source queue algorithm (Program 19.8) the DAG
3-7 1-4 7-8 0-5 5-2 3-8 2-9 0-6 4-9 2-6 6-4 4-3 2-3