Decision 2 - Graphs and Networks Flashcards

1
Q

What is a graph in decision maths?

A

A graph consists of points (called vertices or nodes) which are connected by lines (edges or arcs).
If a graph has a number associated with each edge (usually called its weight), then the graph is known as a weighted graph or network.

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

What is a vertex?

A

A vertex is a point on a graph. Vertices are sometimes called nodes.

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

What is an edge?

A

An edge is a line segment joining vertices. Edges are sometimes called arcs.

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

What is the vertex set?

A

The list of vertices comprising a graph.

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

What is a subgraph?

A

A graph, each of whose vertices belongs to the original graph and each of whose edges belong to the original graph.
It is simply a part of the original graph.

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

What is the degree of a vertex?

A

The degree or valency or order of a vertex is the number of edges incident. If the degree of a vertex is even, it is said to have even degree.

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

What does it mean if an edge and vertex are incident?

A

A vertex and an edge are incident if the vertex is at either end of the edge.

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

What is a walk?

A

A route through the graph along edges from one vertex to the next.

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

What is a path?

A

A path is a walk in which no vertex is visited more than once.

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

What is a trail?

A

A trail is a walk in which no edge is visited more than once.

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

What is a cycle?

A

A cycle is a walk in which the end vertex is the same as the start vertex and no other vertex is visited more than once.

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

What is a Hamiltonian cycle?

A

A Hamiltonian cycle is a cycle that includes every vertex.

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

What does it mean for two vertices to be connected?

A

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

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

What does it mean for a graph to be connected?

A

A graph is connected if all its vertices are connected.

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

What is a loop?

A

A loop is an edge that starts and ends at the same vertex.

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

What does it mean for a graph to be simple?

A

A simple graph is one in which there are no loops and there is at most one edge connecting any pair of vertices.

17
Q

What is a directed edge?

A

If an edge of a graph has a direction associated with it, it is known as a directed edge and the graph is known as a directed graph, often abbreviated to a digraph.

18
Q

What is the sum of the degrees of the vertices of any undirected graph?

A

The sum of the degrees is equal to 2×the number of edges. As a consequence, the number of odd vertices must be even, including possibly zero. This result is known as Euler’s handshaking lemma.

19
Q

What is a tree?

A

A tree is a connected graph with no cycles.

20
Q

What is a spanning tree?

A

A spanning tree is a subgraph which includes all the original graph’s vertices and is also a tree.

21
Q

What is a complete graph?

A

A complete graph is a graph in which every vertex is directly connected by a single edge to each of the other vertices.
The complete graph of 𝑛 vertices is written Kₙ.

22
Q

What is an isomorphic graph?

A

An isomorphic graphs are graphs that show the same information but may be drawn differently.

23
Q

What is an adjacency matrix?

A

Each entry in an adjacency matrix describes the number of arcs joining the corresponding vertices.

24
Q

What is a distance matrix?

A

A matrix associated with a weighted graph, in a distance matrix, the entries represent the weight of each arc, not the number of arcs.

25
Q

What is a planar graph?

A

A planar graph is one that can be drawn in a plane such that no two edges meet except at vertices.

26
Q

What is the planarity algorithm?

A

The planarity algorithm can be applied to graphs that containing a Hamiltonian cycle.
The algorithm is as follows:
1) Identify a Hamiltonian cycle.
2) Draw a polygon with vertices labelled to match the ones in the Hamiltonian cycle.
3) Draw edges inside the polygon to match the edges of the original graph not already represented by the polygon itself.
4) Make a list of all edges inside the polygon, in any order.
5) Choose any unlabelled edge and label it ‘I’. If all edges are now labelled then the graph is planar.
6) Look at any unlabelled edges that cross the edge(s) just labelled:
•If there are none, then go back to step 5.
•If any of these edges cross each other, then the graph is non planar.
•If none of these edges cross each other, give them the opposite label to the edge(s) just labelled.
•If all edges are now labelled, the graph is planar. Otherwise, go back to the start of step 6.

27
Q

What is a minimum spanning tree?

A

Sometimes called a minimum connector, a minimum spanning tree is a spanning tree of a weighted graph such that the total length of its arcs (edges) is as small as possible.