Graph Definitions Flashcards

1
Q

What is a path?

A

A finite sequence of edges with no vertices appearing more than once

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

What is a walk?

A

A path where you are allowed to visit a vertex more than once

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

What is a cycle 🚲

A

A closed path I.e. You must start and end with the same vertex.

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

What is a valency?

A

It is the number of edges that come from the vertex

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

What is a bipartite graph?

A

Two sets of vertices where no vertices from the same set are connected.

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

What is a simple graph?

A

No loops and no more than one edge connecting two vetecies.

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

What is a complete graph?

A

Every vertex is directly connected to each other.

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

What is an isomorphic graph?

A

Same info in a different way

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

What is a digraph?

A

Contains directed edges

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

What does a graph consist of?

A

Vertices which are connected by edges

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

What is a weighted graph?

A

If the graph has a number associated with each edge.

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

What is a loop?

A

Is 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 tree?πŸŒ³πŸŒ²πŸŒ΄πŸŽ„πŸŒΏπŸƒπŸŽ‹πŸŽπŸŒ΅

A

Is a connected graph with no cycles

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

What is a distance matrix?

A

Records the weights on the edges where there is no weight there is a dash.

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

What is a minimum spanning tree ?

A

Is a spanning tree such as the total length of its arcs is the smallest possible.