Graphs Test Flashcards

1
Q

What is a graph?

A

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

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

What is a weighted graph? What is another term for weighted graph?

A

A graph which has a weight associated with each edge and otherwise known as a network.

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

What is a subgraph?

A

A graph where each of its vertices and edges belong to the original graph. It is a part of the original graph.

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

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

What is a walk?

A

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

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

What is a path?

A

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

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

What is a trail?

A

A walk which no edge is visited more than once.

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

What is a cycle?

A

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

What is a loop?

A

An edge that starts and finished at the same vertex.

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

What is a simple graph?

A

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

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

What is a digraph?

A

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

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

What is Euler’s handshaking lemma?

A

In any undirected graph, the sum of the degrees of the vertices is equal to 2x the number of edges; leading to the number of odd vertices being even.

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

What is a tree?

A

A tree 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 spanning tree?

A

A spanning tree of a graph is a subgraph of which includes all the vertices of the original graph and is a tree.

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

What is a complete graph?

A

A graph in which every vertex is directly connected by a single edge to each of the other vertices.

17
Q

Isomorphic graph

A

Graphs which show the same information but may be drawn differently.