FeaturesHow It WorksFor ParentsPricingContactLog inStart free — no credit card needed →

General Mathematics · Unit 4 · Graphs and networks · Graphs, associated terminology and the adjacency matrix

Understand the meaning of graph, vertex (node), edge (arc), loop, degree of a vertex, subgraph, simple graph, complete graph, bipartite graph, directed graph (digraph), weighted graph and network.

Practise this objective

AI-marked practice questions tied to QCAA mark schemes for this exact LO. Free to start.

Start free practice

Practice questions for this objective

Full questions, answers and worked solutions unlock when you start a free practice session.

Question 1

A network graph representing five computer servers (labelled \(A\), \(B\), \(C\), \(D\) and \(E\)) and their direct connections is shown in the diagram. (a) State the degree of vertex \(C\). (1 mark) (b) Determine whether the graph is a simple graph. Justify your answer. (1 mark) (c) State whether the subgraph containing only vertices \(A\), \(B\), \(D\) and the edges connecting them forms a complete graph. Justify your answer. (1 mark)

Worked answer
🔒 Start free to see full answer
Question 2

A network represents seven computer terminals, labelled \(A\) through \(G\), connected by data cables in a university computer lab. (a) State the degree of vertex \(D\). (1 mark) (b) Identify whether the network contains any loops. Justify your answer. (1 mark) (c) Determine the total number of edges in the network. (1 mark)

Worked answer
🔒 Start free to see full answer
Question 3

A network graph is shown. Which of the following statements correctly describes this network graph?

Worked answer
🔒 Start free to see full answer
Question 4

A network graph is shown. Which statement correctly describes the graph?

Worked answer
🔒 Start free to see full answer
Question 5

A network diagram represents six computer servers (labelled A, B, C, D, E, F) and the direct cable connections between them. (a) State the degree of vertex C. (1 mark) (b) Calculate the number of edges in a complete graph with 6 vertices, and hence determine how many additional edges would be required to make the given network complete. (2 marks)

Worked answer
🔒 Start free to see full answer
Unlock all 5 answers — free

More in Graphs, associated terminology and the adjacency matrix

← Previous
Construct an adjacency matrix from a given graph or digraph.
All LOs in Graphs, associated terminology and the adjacency matrixBack to full General Mathematics syllabus