NETWORK IN GRAPH THEORY

The diagram shows a simple graph. State the sum of degrees of the graph.

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

Which of the following are true?

• n(V) =4, n(E) =6

• n(V)=4,n(E)=8

• n(V)=6,n(E)=4

• n(V)=8,neE)=4

Which of the following graphs has the set of edges as shown above?

• 
• 
• 
• 

The table shows the sets of edges of four graphs where each graph has four vertices.

Which graph is a simple graph?

• P

• Q

• R

• S

The diagram shows a directed graph with four vertices.

State the set of edges of the graph.

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

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

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

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

Which of the following has a sum of degrees such that a graph can be drawn?

• 3, 3, 1, 1

• 3, 2, 2, 2

• 2, 3, 3, 1

• 2, 3, 1, 1

The diagram shows a directed graph with five vertices.

Which of the following is not true?

• d_in (Q) = 3

• d_in (R) = 2

• d_in (S) = 0

• d_in (T) = 1

The diagram shows an undirected weighted graph.

Liza draws a tree with a minimum total weight based on the graph.

Calculate the minimum total weight.

• 12

• 13

• 14

• 15

The diagram shows a graph G.

Which of the following is not a subgraph of graph G?

• 
• 
• 
• 

Which of the following is a tree?

• 
• 
• 
•