Decision maths - graphs and networks Flashcards

1
Q

What is a graph?

A

Points (vertices or nodes) which are connected by lines (arcs or edges)

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

What is a weighted graph/network?

A

When a graph 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 a vertex/node?

A

A point on a graph

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

What is an edge/arc?

A

A line segment joining vertices

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

What is a subgraph of G?

A

A graph, each of whose vertices and edges belong to G. It is 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 or valency of a vertex?

A

The number of edges entering/leaving it

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

What is a walk?

A

A route along edges from one vertex to the next

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

What is a path?

A

A walk in which no vertices are visited more than once

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

What is a trail?

A

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
10
Q

What is a cycle?

A

A walk where the end vertex is the same as the start vertex

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

What is a Hamiltonian cycle?

A

A cycle that includes every vertex

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

When is a graph connected?

A

When all its vertices are connected

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

What is a loop?

A

An edge that starts and finishes at the same vertex

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

What is a directed graph?

A

One where the edges of a graph have direction associated to them

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
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
16
Q

What is a spanning tree?

A

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

17
Q

What is a complete graph?

A

Every vertex is directly connected to every other one

18
Q

What is an isomorphic graph?

A

Graphs showing the same information but are drawn differently

19
Q

What is the handshaking lemma?

A

In an undirected graph, the sum of the degrees of the vertices is equal to double the number of edges. This means the number of odd vertices must be even

20
Q

Eularian cycle

A

All nodes are even

21
Q

Semi-Eularian cycle

A

2 odd nodes