D1 Definitions Flashcards

1
Q

What is a Graph?

A

A graph consists of vertices which can be connected by arcs / edges.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is a Subgraph?

A

A graph of G, of whose vertices and edges belongs to G.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is a Network?

A

A graph with a weight associated to each of its edges.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is a Degree / Valency of a vertex?

A

The number of arcs connected to a vertex. A vertex is odd / even if it has odd / even degree.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Define a path.

A

A path is a finite sequence of edges, such that the end vertex of one edge in the sequence is the start vertex of the next, and in which no vertex appears more than once.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Define a Cycle / Circuit.

A

This is a closed path where the end vertex of the last arc is the start vertex of the first arc.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What makes vertices and graphs connected?

A

Two vertices are connected if there is a path between them.

A graph is connected if all of its vertices are connected.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is a Tree?

A

A tree is a connected graph with no cycles.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is a Spanning Tree?

A

A subgraph which includes all the vertices of G and is also a tree.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is a Minimum Spanning Tree?

A

A spanning tree such that the total length of its arcs is as small as possible.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is a Complete graph?

A

A graph in which each vertex is connected to every other vertex.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is a Bipartite graph?

A

A bipartite graph consists of two sets of vertices X and Y. The edges only join vertices in X to those in Y (not vertices within a set).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Define a Matching.

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Define a Complete Matching.

A

A matching in which every vertex of X is paired with a vertex of Y.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is total float?

A

The total float F(i, j) of activity (i, j) is defined to be F(i, j) = lj – ei – duration (i, j), where ei is the earliest time for event i and l j is the latest time for event j.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Explain why a dummy activity may be needed

A

– To show dependency where subsequent activities do not all depend on the same preceding activities.
or
– To show that an activity can be uniquely represented in terms of its end events.