Network in Graph Theory (Mathematics Form 4 KSSM Chapter 5)

Determine the number of vertices, n(V) of the following graph.

• 6

• 5

• 10

• 12

Determine the number of edges, n(E) of the following graph.

• 4

• 5

• 6

• 7

Determine the sum of degrees of the following graph.

• 5

• 6

• 10

• 12

Based on the given graph, which of the statement below is false.

• V = {A, B, C, D, E}

• E = {e₁, e₂, e₃, e₄}

• E= {(A,B),(B,C),(C,D),(D,E)}

• V= 2E

What are the conditions of a simple graph?

• No loops

• No multiple edges

• Sum of degrees = 2V

• n(V)=n(E)

Based on the given graph, choose the correct statement.

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

• n(E)=9

• $\Sigma d\left(v\right)=14$

• It is a simple graph.

Given V={1, 2, 3, 4, 5, 6} and E={(1,2),(2,3),(2,4),(3,4),(3,6),(4,5)}. Which of the graph below represents the set of vertices and edges given?

• 
• 
• 
• 

Which of the following denotes a simple graph?

• V={A, B, C, D, E}

  E={(A,B),(A,C),(B,C),(C,D),(C,E),(C,E),(D,E)}

• V={A, B, C, D, E}

  E={(A,B),(A,C),(B,C),(B,D),(B,E),(C,E),(D,E)}

• V={A, B, C, D, E}

  E={(A,B),(A,B),(A,C),(B,D),(C,E),(C,D),(D,E)}

• V={A, B, C, D, E}

  E={(A,B),(A,C),(B,C),(C,C),(C,D),(C,E),(D,E)}

Based on the following degrees of vertices given, determine which graph can be drawn.

• 3, 2, 1, 3, 4

• 4, 3, 2, 2, 1

• 3, 2, 2, 3, 1, 3

• 4, 2, 4, 3, 1, 2

Based on the given graph, which of the following statement is true.

• Sum of degrees=8

• Degree of vertex M=5

• Degree of vertex O=3

• Number of edges=9