D1

Question 1

Graph

Answer 1

Diagram involving a set of points and interconnecting lines

Question 2

Vertex

Answer 2

A point on a graph

Question 3

Edge

Answer 3

A connecting line on a graph between two points

Question 4

Loop

Answer 4

Line connecting a vertex to itself

Question 5

Multiple edges

Answer 5

Two edges connecting two points

Question 6

Simple graph

Answer 6

No loops or multiple edges

Question 7

Connected

Answer 7

Possible to travel from any vertex to any other vertex (you can go via other vertices)

Question 8

Degree

Answer 8

The no. edges arriving at a vertex

Question 9

Complete graph

Answer 9

There is an edge connecting every possible pair of vertices

Question 10

Kn is the complete graph with n vertices. How many edges does it have?

Answer 10

1/2n(n-1)

Question 11

What does an adjacency matrix show?

Answer 11

the number of direct routes from one vertex to another

Question 12

Network

Answer 12

Graph where each edge has an associated number it’s ‘weight’

Question 13

What does a distance matrix show?

Answer 13

the weights of the routes between one vertex to another

Question 14

Walk

Answer 14

sequence of connected edges

Question 15

Trail

Answer 15

Walk where you can’t use any edge more than once

Question 16

Closed trail

Answer 16

Trail that returns to the starting vertex

Question 17

Path

Answer 17

Trail that doesn’t revisit any vertices

Question 18

Cycle

Answer 18

closed path