Font size
WorksheetsMATHS ( NETWORK)
Total questions: 17
Worksheet time: 12mins
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
Which of the following statements in not true?
V = { P, Q, R, S, T}
E = { (P,Q), (Q,R), (S,R), (S,T), (T,T), (P,S), (S,P)}
din (T) = 2
sum of degree = 14
In the Graph Theory, a graph need to have a minimum of _____ nodes and _____ edges.
1 ; 0
1 ; 1
2 ; 1
2 ; 2
Choose the FALSE statement from the statements below.
A node is also known as a vertex.
A link is also known as an edge.
A loop is counted as two edges.
The order of a graph is the total number of vertices of the graph.
Which of the following is a TRUE statement?
A graph can have many nodes but without edges.
A graph can have many edges but without nodes.
A graph can have no nodes and no edges.
A graph cannot be simple graph and complete graph at the same time.
Determine the sum of degrees
(a)
State the number of vertices
8
6
7
5
State the number of vertices.
14
3.5
7
5
State the number of edges.
18
7
9
6
Determine the sum of degrees.
16
8
4
13
Determine the n(E) for this graph with multiple edges and loops.
8
20
5
10
State Σ d(v)
4
8
16
32
Determine n(V).
4
8
5
10
In the Graph Theory, a graph need to have a minimum of _____ nodes and _____ edges.
1 ; 0
1 ; 1
2 ; 1
2 ; 2
An edge that connects a
vertex to itself
Vertex
Loops
Multiple graph
Undirected graph
Diagram 1 shows a graph. Calculate the sum of degree.
9
12
18
20
