D1 - Graphs And Networks Flashcards

0
Q

What is a sub graph?

A

Part of a graph.

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

What does a graph consist of?

A

Consists of vertices/nodes which are connected by edges/arcs.

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

What is a weighted graph?

A

If a graph has a number associated with each edge (weight) then the graph is weighted.

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

What is the degree of a vertex.

A

The degree or valency or order of a vertex is 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 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 path in which you are permitted to return to vertices 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, the vertex of the last edge is the start vertex of the first edge.

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

How are two vertices connected?

A

If there is a path between them.

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

How is a graph connected?

A

If all it’s vertices are connected.

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

What is a simple graph?

A

One in which there are no loops and not more than one edge connecting any pair of vertices.

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

What is a digraph?

A

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

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

What is a spanning tree of a graph?

A

A sub graph which includes all the vertices and is also a tree.

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

What is a bipartite graph?

A

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

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

What is a complete graph?

A

A graph in which every vertex is directly connected by an edge to each of the other vertices, if the graph has an vertices the connected graph is denoted Kn.

16
Q

What is a complete bipartite graph?

A

Denoted Kr,s

A graph in which there are r vertices in set X and a in set Y.

17
Q

What do isomorphic graphs show?

A

The same information but drawn differently.

18
Q

What does an adjacency matrix do?

A

Records the number of direct links between vertices.

19
Q

What does a distance matrix do?

A

Records the weights on the edges.

Where there is no weight, indicate by -