wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

Chapter 5: Network in Graph Theory (F4)

Total questions: 20

Worksheet time: 15mins

Name
Class
Date
1.

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

a)

It must be directed.

b)

It must be undirected.

c)

It must have at least one vertex.

d)

It must have no multiple edges.

2.

Determine a simple graph.

a)
b)
c)
d)

All the graphs are simple graphs.

3.

Which graph is a simple graph but not complete graph?

a)
b)
c)
d)
4.

By looking at the pattern of the numbers in the table, determine the number of edges for a complete graph to be drawn from 9 nodes given.

a)

28

b)

36

c)

45

d)

55

5.

Which one is NOT a subgraph of the above graph?

a)
b)
c)
d)
6.

Which of the following statements in not true?

a)

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

b)

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

c)

d(P) = 3

d)

sum of degree = 14

7.

Which of the statements below is not true

a)

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

b)

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

c)

d(R) = 3

d)

sum of degree = 18

8.

The directed graph on the right shows the

roads connecting Lani’s house at A to the

school at E. Suggest the shortest route

that Lani can choose to cycle to school.

a)

A > C > D > E

b)

A > B > C > E

c)

A > D > E

d)

A > B > E

9.

Determine the number of vertices and sum of degrees.

a)

8,16

b)

8,8

c)

6,4

d)

8,13

10.

Find Σd(v).

a)

5

b)

10

c)

12

d)

24

11.

Determine the sum of degrees.

a)

4

b)

8

c)

16

d)

32

12.

Determine n(E).

a)

7

b)

12

c)

14

d)

6

13.

Determine n(V).

a)

4

b)

8

c)

5

d)

10

14.

Choose the correct term to match each definition: Lines or curves that connect vertices.

a)

Regions

b)

Vertices

c)

Edges

d)

Paths

15.

An edge that begins and ends at the same vertex.

a)

Multiple edges

b)

Vertices

c)

Loop

d)

Node

16.

Links that connect the same two vertices to one another.

a)

Multiple edges

b)

Vertices

c)

Loop

d)

Nodes

17.

When the edges have a numerical representation (to indicate length, time, capacity etc.).

a)

Multiple edges

b)

Weighted graph

c)

Complete graph

d)

Directed graph

18.

No arrows are shown on the edges.

a)

Directed graph

b)

Weighted graph

c)

Simple graph

d)

Undirected graph

19.

An undirected and unweighted graph with no multiple edges.

a)

Undirected graph

b)

Unweighted graph

c)

Incomplete graph

d)

Simple graph

20.

A loop is counted as _____ edge(s) but _____ degree(s).

a)

one, two

b)

one, one

c)

two, two

d)

two, one