Graphs Flashcards

1
Q

What are graphs?

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

What is a directed graph?

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

What are undirected graphs?

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

What are simple graphs?

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

What are directed multigraphs?

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

What are undirected multigraphs?

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

What are weighted multigraphs?

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

What are adjacency, neighbourhood, and degrees in undirected graphs?

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

What is the handshaking theorem?

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

Example of the handshaking theorem

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

What are in-degrees and out-degrees in directed graphs?

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

What is the theorem for degrees in directed multigraphs?

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

What are complete graphs?

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

What is a cycle graph?

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

What is a wheel graph?

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

What are cube graphs?

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

What are bipartite graphs?

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

.

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

Can a graph with loops be bipartite?

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

What is a complete bipartite graphs?

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

What is a subgraph?

A
22
Q

.

A
23
Q

What are unions of graphs?

A
24
Q

What are adjacency lists?

A
25
Q

What are adjacency matrices?

A
26
Q

What are adjacency matrices for undirected graphs?

A
27
Q

What are adjacency matrices for directed multigraphs?

A
28
Q

What are adjacency matrices for undirected multi graphs?

A
29
Q

.

A
30
Q

.

A
31
Q

What are incidence matrices for directed multigraphs?

A
32
Q

What are incidence matrices for undirected multigraphs?

A
33
Q

What is graph isomorphisms?

A
34
Q

Examples of graph isomorphism

A
35
Q

What is a path in a graph?

A
36
Q

What are paths for undirected multigraphs?

A
37
Q

What are paths for directed multigraphs?

A
38
Q

Examples of path lengths

A
39
Q

What is undirected connectivity?

A
40
Q

Examples of undirected connectivity

A
41
Q

What is directed connectivity?

A
42
Q

Examples for directed connectivity

A
43
Q

How do you count paths between vertices

A
44
Q

What are Euler paths and circuits

A
45
Q

What are the conditions for Euler paths and circuits for undirected graphs?

A
46
Q

What are the conditions for Euler paths and circuits for directed graphs?

A
47
Q

Example of Euler paths

A
48
Q

What are Hamilton paths and circuits?

A
49
Q

What are conditions for Hamilton paths and circuits?

A
50
Q

What is the travelling salesman problem?

A