Decision Maths

Question 1

Arc

Answer 1

Line segment

Question 2

Node

Answer 2

A point

Question 3

Trail

Answer 3

Sequence of arcs

Question 4

Closed Trail

Answer 4

Start and finish at the same node but no other duplication

Question 5

Path

Answer 5

Trail when no node is visited more than once

Question 6

Cycle

Answer 6

Trail that ends where it started and does not repeat any arc.

Question 7

Tree

Answer 7

Connected graph with no cycles. (N-1) arcs, N nodes

Question 8

Connected graph

Answer 8

A group where there exists a path to join a node to any other.

Question 9

Complete Graph

Answer 9

Every node is directly connected to all other nodes

Question 10

Bipartite graph

Answer 10

Graph consisting of two sets of nodes with arcs joining only between the two sets, not within a set

Question 11

Order of a node

Answer 11

Number of arcs meeting at the node

Question 12

Planar graph

Answer 12

Graph that can only be drawn so that arcs only meet at nodes

Question 13

Simple graph

Answer 13

Graph with no loops or multiple arcs

Question 14

Eulerian graph

Answer 14

Where all nodes are even and connected. A closed trail or using all arcs once.

Question 15

Semi-Eulerian Graph

Answer 15

Graph with exactly two odd nodes. Connected trail using every arc once but starting and finishing at different nodes.

Question 16

Euler’s relationship

Answer 16

Nodes + regions = arcs + 2

Question 17

Graph

Answer 17

Set of points joined by lines

Question 18

Order of an algorithm

Answer 18

A measure of how efficient an algorithm is