Question 1: Numerical Answer.

Consider the graph G (V,E) where V is the set of vertices and E is the set of undirected edges. V = {A, B, C, D, E, F, G} and E = {(D,C), (E,A), (D,B), (E,B), (G,D), (E,F)}.

If this graph is a tree and rooted at vertex A, then this tree has a height equal to __________. (It would help to draw the graph to answer the questions).

Question 2: Check all that apply.

Consider the graph G (V,E) where V is the set of vertices and E is the set of undirected edges. V = {A, B, C, D, E} and E = {(D,C), (D,B), (E,B), (A,D)}.

If this graph is a tree and rooted at vertex B, then these nodes are leaves. (It would help to draw the graph to answer the questions).

a. C

b. None of these answers

c. D

d. E

e. B

f. A

Question3: Numerical Answer.

Consider the graph G (V,E) where V is the set of vertices and E is the set of undirected edges. V = {A, B, C, D, E, F, G} and E = {(D,C), (E,A), (D,B), (E,B), (G,D), (E,F)}.

If this graph is a tree and rooted at vertex C, then this tree has a height equal to __________ . (It would help to draw the graph to answer the questions).

Question 4: Check all that apply.

Consider the graph G (V,E) where V is the set of vertices and E is the set of undirected edges. V = {A, B, C, D, E} and E = {(A,D), (D,C), (C,E), (B,D), (E,B)}.

Check all properties that this graph has. (It would help to draw the graph to answer the questions).

a. undirected

b. connected

c. None of these answers

d. acyclic