QUESTION 1
A graph has vertex set V = {A, B, C, D, E, F} and edge set E = {{A, E}, {A, F}, {B, C}, {B, D}, {C, D}, {E, F}}.
a. What is the order of this graph?
b. How many components does this graph have?
c. What is the degree (or valence) of vertex B?
QUESTION 2
A graph has vertex set V = {A, B, C, D, E, F} and edge set E = {{A, E}, {A, F}, {B, C}, {B, D}, {C, D}, {E, F}}.
This graph is connected.
True
False
QUESTION 3
Consider the graph below.
A → F → E → A is a simple circuit.
True
False
QUESTION 4
Consider the graph below.
B → C → D → B is an Euler circuit.
True
False
QUESTION 5
Consider the graph below.
B → C → D → E → F → A → D → B is a Hamilton circuit.
True
False