Network in Graph Theory (KSSM Mathematics, 5.1b)

Which of the following is true about directed graph?

Manakah antara berikut benar mengenai graf terarah?

• Direction is assigned to the edges connecting two vertices.

  Tepi yang mengaitkan dua bucu ditanda dengan arah kaitan.

• Usually used to represent the flow of a certain process.

  Biasanya digunakan untuk mewakilkan aliran sesuatu proses.

• 
• The sum of degree is twice the number of edges.

  Bilangan darjah adalah dua kali bilangan tepi.

Which of the following is directed graph?

Manakah antara berikut ialah graf terarah?

• 
• 
• 
• 

Choose all the correct information for the graph given.

Pilih semua informasi yang benar bagi graf yang diberi.

• Directed graph
  Graf terarah

• $d_{in}\left(v_2\right)=3$

• $d_{in}\left(v_1\right)=2$

• Sum of degree = 8
  Bilangan darjah = 8

Which of the following is true about the edge of the graph shown above?

Manakah antara yang berikut benar mengenai tepi bagi graf di atas?

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

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

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

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

Choose all the weighted graph from below.

Pilih semua graf berpemberat daripada bawah.

• 
• 
• 
• 

Choose all the true information about the weighted graph.

Pilih semua informasi yang benar mengenai graf yang berpemberat.

• Only directed graph can be a weighted graph.

  Hanya graf terarah boleh dijadikan graf berpemberat.

• Each edge is given a value or weight.

  Setiap tepi diberi satu nilai atau pemberat.

• The edges can represent the cost of travelling between town A and town B.

  Tepi boleh mewakili kos yang diambil dari bandar A ke bandar B.

• Bubble map is one of the weighted graph.

  Peta buih ialah salah satu graf berpemberat.

Given that / Diberi
V = {P, Q, R, S}
E = {(P, Q), (Q, R}, (R, Q), (Q, Q)}.
Choose all the correct statement / diagram from the information given above.
Pilih semua pernyataan / rajah yang benar daripada informasi yang diberi.

• This is an undirected graph.

  Ini ialah graf tak terarah.

•  $d_{out}\left(Q\right)=2$  

• S is an isolated vertex.
  S ialah satu bucu terpencil.

• 

Calculate the shortest distance from v1 to v4.

Hitung jarak terdekat dari v1 ke v4.

• 1000 m

• 1100 m

• 1400 m

• 2000 m

Which of the following is the longest route?

Manakah antara berikut ialah laluan yang terpanjang?

• KS, S, CJ, T

• KS, CJ, T

• KS, M, K, T

• KS, S, M, K, T

The diagram above shows the link between each town.

Which of the two towns below is nearest to each other?

Rajah di atas menunjukkan laluan antara setiap bandar.

Manakah dua bandar antara berikut adalah paling dekat antara satu sama lain?

• Karak - Temerloh

• Kuala Krau - Bandar Bera

• Lanchang - Teriang

• Kuala Kurau - Karak