Form 4 Mathematics KSSM Chap 5 Network in graph theory 2

Form 4 Mathematics KSSM Chap 5 Network in graph theory 2

11th Grade

10 Qs

quiz-placeholder

Similar activities

SOAL PERBAIKAN KELAS XI

SOAL PERBAIKAN KELAS XI

11th Grade

15 Qs

NÚMEROS INTEIROS OPOSTOS OU SIMÉTRICOS

NÚMEROS INTEIROS OPOSTOS OU SIMÉTRICOS

9th - 12th Grade

12 Qs

Adding & Multiplying Probability

Adding & Multiplying Probability

9th - 12th Grade

11 Qs

Logarithme néperien

Logarithme néperien

10th - 12th Grade

10 Qs

Sucessões

Sucessões

11th Grade

12 Qs

Complex & Quadratics

Complex & Quadratics

10th - 11th Grade

15 Qs

Elektromagnetika Dasar (PGD)

Elektromagnetika Dasar (PGD)

11th Grade

14 Qs

Practica de trigonometria

Practica de trigonometria

11th Grade

10 Qs

Form 4 Mathematics KSSM Chap 5 Network in graph theory 2

Form 4 Mathematics KSSM Chap 5 Network in graph theory 2

Assessment

Quiz

Mathematics

11th Grade

Practice Problem

Hard

Created by

LAI Moe

Used 69+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A graph is denoted by a set of ordered pairs G = (V, E) as described below EXCEPT


Tatatanda graf merupakan set pasangan tertib iaitu G = (V, E) dengan keadaan berikut KECUALI

V is the set of dots or vertices.

V ialah set bintik atau bucu.

E is the set of edges or lines linking each pair of vertices.

E ialah set tepi atau garis yang menghubungkan sepasang bucu.

Σd(v) = 2E ; v ∈ V

V = E

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following statement is true about Simple Graph?

Manakah antara pernyataan di bawah adalah benar mengenai Graf Mudah?

A simple graph has no loops and no multiple edges.

Graf mudah ialah graf yang tidak mengandungi gelung atau berbilang tepi.

A simple graph has a loop but no multiple edges.

Graf mudah ialah graf yang mengandungi satu gelung tetapi tidak berbilang tepi.

A simple graph has no loop but with multiple edges.

Graf mudah ialah graf yang tidak mengandungi satu gelung tetapi mempunyai berbilang tepi.

The sum of degrees of the graph is equal to the

number of edges.

Bilangan darjah adalah sama dengan bilangan tepi.

3.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

Choose all the simple graph below.

Pilih semua graf mudah di bawah.

Media Image
Media Image
Media Image
Media Image
Media Image

4.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

Choose all the graphs with multi edges and / loop(s).

Pilih semua graf yang mempunyai berbilang tepi dan / atau gelung.

Media Image
Media Image
Media Image
Media Image
Media Image

5.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

Media Image

Choose all the correct information about the simple graph given.

Pilih semua informasi yang benar bagi graf mudah yang diberi.

n(V) = 4

n(V) = 5

n(E) = 4

n(E) = n(V)

Sum of degree = 10

Bilangan darjah = 10

6.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

Media Image

Choose all the correct information for the simple graph given.

Pilih semua informasi yang benar bagi graf mudah yang diberi.

V = {A, B, C, E, F, G}

V = {A, B, C, D, E, F, G}

E = {A, B, C, D, E. F. G}

E = {AB, AC, BC, BD, BE, CD, CF, DE, DF, EF, EG, FG}

n(E) = 12

7.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

Media Image

Choose all the correct information about the graph given.

Pilih semua informasi yang benar bagi graf yang diberi.

n(V) = 4

n(E) = 3

Sum of degree = 6

Bilangan darjah = 6

d(v3)=2d\left(v_3\right)=2

d(v3)+d(v6)=3d\left(v_3\right)+d\left(v_6\right)=3

Create a free account and access millions of resources

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?