Assume you have a graph with vertex set V = {A, B, C, D, E} and ...

[Capo]

Assume you have a graph with vertex set V = {A, B, C, D, E} and edge set E = {CD, CB, DA, DB, EA, AA}.

Suppose that edge AE is removed from the graph. Which of the following statements regarding the resulting graph is true?
◦ The resulting graph has two components.
◦ The resulting graph has 10 components.
◦ The resulting graph is connected.
◦ All of these are true.
◦ None of these are true.

[Sassygurl126]

The resulting graph has two components.

[vicotolentino]

Question 1

Assume you have a graph with vertex set V = {A, B, C, D, E} and edge set E = {CD, CB, DA, DB, EA, AA}.

How many paths are there from B to A?
◦ 4
◦ 1
◦ 2
◦ 0
◦ None of these are true.

Question 2

Assume you have a graph with vertex set V = {A, B, C, D, E} and edge set E = {AB, AE, BD, BE, CD, and DD}.

The bridges of the graph are
◦ BD and CD.
◦ BD, CD, and DD.
◦ AB, BD, and CD.
◦ BD only.
◦ none of these

[kaillie]

Answer 1

4

Answer 2

BD and CD.

[Metfan725]

Assume you have a graph with vertex set V = {A, B, C, D, E} and edge set E = {AB, AE, BD, BE, CD, and DD}.

Which of the following [A), B), C) or D)] is not a circuit of the graph?
◦ E, B, A, E
◦ D, D
◦ A, B, E, A
◦ A, B, D, D, B, E, A
◦ none of these

[ndhahbi]

A, B, D, D, B, E, A

[maychende]

Assume you have a graph with vertex set V = {A, B, C, D, E} and edge set E = {CD, CB, DA, DB, EA, AA}.

Which of the following statements is true?
◦ The graph has a closed unicursal tracing.
◦ The graph has an Euler path from vertex E to vertex D.
◦ The graph has an Euler circuit.
◦ All of these are true.
◦ None of these are true.

[fwbard]

The graph has an Euler path from vertex E to vertex D.