C5: Network In Graph Theory

In graph theory, network is a graph that has at least _______ related dot(s).

• 1

• 2

• 3

• 4

Which of the following statements is false?

• Dot in a graph is known as vertex.

• Line that connects two dots is known as edge.

• A loop has degree of 2.

• The degree of a vertex is the number of edges that are pointing out of the vertex.

Which of the following is a simple directed graph?

• 
• 
• 
• 

State the degree of vertex P.

• 2

• 3

• 4

• 5

What is the degree of vertex F?

• 1

• 2

• 3

• 4

The diagram above shows a graph such that the weight is distance,

in km. Find the shortest path from A to E.

• A --> B --> E

• A --> C --> D --> E

• A --> B --> D --> E

• A --> D --> E

The diagram shows a simple graph.

State the sum of degrees of the graph.

• 6

• 10

• 12

• 15

The diagram shows a directed graph with four vertices.

State the set of edges of the graph.

• E = { (P, R), (P, S), (Q, R), (R, S) }

• E = { (P, S), (Q, R), (R, P), (S, R) }

• E = { (P, S), (R, P), (R, Q), (R, S) }

• E = { (P, S), (R, P), (R, Q), (S, R) }

The diagram shows a graph with a loop and multiple edges.

Which of the following are true?

• $n\left(V\right)=4,\ n\left(E\right)=6$

• $n\left(V\right)=4,\ n\left(E\right)=8$

• $n\left(V\right)=6,\ n\left(E\right)=4$

• $n\left(V\right)=8,\ n\left(E\right)=4$