CHAPTER 5: NETWORK IN GRAPH THEORY

State the number of vertices of the graph.

• 6

• 7

• 12

• 14

A simple graph has no loops. What other property must a simple graph have?

• It must be directed.

• It must be undirected.

• It must have at least one vertex.

• It must have no multiple edges.

Determine a simple graph.

• 
• 
• 
• All the graphs are simple graphs.

Which one is NOT a subgraph of the above graph?

• 
• 
• 
• 

Which of the statements below is not true

• V = {P, Q, R, S, T, U}

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

• d(R) = 3

• sum of degree = 18

Which of the following statements in not true?

• V={ P, Q, R, S, T, U}

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

• d(P) = 3

• sum of degree = 14

The following undirected graph shows six houses in a village. A salesperson needs to visit all

the houses starting from house A and finishing at house F. Calculate the shortest distance in km.

• 3.05

• 3.08

• 3.30

• 3.68

State the number of edges.

• 18

• 7

• 9

• 6

Tags

CCSS.6.G.A.4

Determine the sum of degrees.

• 16

• 8

• 4

• 13

Tags

CCSS.4.MD.C.7

Determine the n(E) for this graph with multiple edges and loops.

• 8

• 20

• 5

• 10