Keywords

Question 1

Graph

Answer 1

Consists of nodes which are connected by arcs

Question 2

Subgraph

Answer 2

Is a part of a graph

Question 3

Weighted graph/network

Answer 3

If the graph has a number associated with each edge

Question 4

Degree/valency

Answer 4

The number of arcs incident to a vertex

Question 5

Path

Answer 5

Finite sequence of edges, such that the end vertex of one edge in the sequence is the start vertex of the next, in which no vertices appear more than once

Question 6

Cycle/circuit

Answer 6

A closed path, the end vertex of the last edge is the start vertex of the first edge

Question 7

Connected

Answer 7

Vertices are connected if there is a path between them. A graph is connected if all its vertices are connected

Question 8

Digraph/direct edges

Answer 8

If the edges of a graph have a direction associated with them

Question 9

Tree

Answer 9

Connected graph with no cycles

Question 10

Spanning tree

Answer 10

Subgraph of a graph which includes all the vertices and is also a tree

Question 11

Minimum spanning tree

Answer 11

A spanning tree such that all the lengths of its arcs are as small as possible

Question 12

Complete graph

Answer 12

A graph in which all of the vertices are connected to every other vertex

Question 13

Total float

Answer 13

The amount of time an activity can be delayed without affecting the duration of the project

Question 14

Bipartite graph

Answer 14

Consists of two sets of vertices X and Y, the edges only join vertices in X to vertices in Y, not vertices within a set

Question 15

Matching

Answer 15

The pairing of some or all of the elements of one set X with elements of a second set Y

Question 16

Complete matching

Answer 16

The pairing of every member of one set X with every member of a second set Y