Graphs And Networks Flashcards

0
Q

What is a subgraph?

A

A subgraph is part of a graph.

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

What is a graph?

A

A graph consists on nodes which are connected by arcs.

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

When is a graph weighted?

A

When it has a number associated with each edge.

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

What is the degree or valency or order of a vertex?

A

The number of edges incident to it.

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

What is 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
5
Q

What is a walk?

A

A walk is a path in which you are permitted to return to verticies more than once.

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

What is a cycle?

A

A closed path.

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

When are verticies connected?

A

If there is a path between them. A graph is connected if all it’s verticies are connected.

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

What is a loop?

A

A loop is an edge that starts and finishes as the same vertex.

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

What is a simple graph?

A

A graph which there are no loops and not more than one edge connecting any pair of verticies.

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

What are digraphs?

A

Is the edges of a graph have a direction associated with them they are known as directed edges and the graph is known as a digraph.

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

What is a tree?

A

A connected graph with no cycles.

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

What is a spanning tree?

A

A spanning tree of a graph which includes all the verticies of the graph and is also a tree.

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

What is a bipartite graph?

A

It consists of two sets of verticies. Arcs only connect nodes between nodes in opposite sets.

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

What is a complete graph?

A

Is a graph in which every vertex is directly connected by an edge to each of the other verticies. If the graph has n verticies it is denoted by Kn.

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

What is an isomorphic graph?

A

It shows the same information but is drawn differently.

16
Q

What is an adjacency matrix?

A

It records the number of direct links between the verticies.

17
Q

What is a distance matrix?

A

It records the weights on the edges. Where there is no weight this is indicated by ‘-‘.

18
Q

Give an advantage of first-fit bin packing.

A

It is quick

19
Q

Give a disadvantage of first-fit bin packing.

A

Not likely to lead to a good solution.

20
Q

Give an advantage of first-fit decreasing bin packing.

A

Easy to do

Usually a good solution

21
Q

Give an disadvantage of first-fit decreasing bin packing.

A

Not necessarily an optimum solution.

22
Q

Give an advantage of full bin packing.

A

Good solution

23
Q

Give an disadvantage of full bin packing.

A

Difficult to do with lots of numbers/awkward numbers