Graphs Flashcards
1
Q
What are graphs?
A
2
Q
What is a directed graph?
A
3
Q
What are undirected graphs?
A
4
Q
What are simple graphs?
A
5
Q
What are directed multigraphs?
A
6
Q
What are undirected multigraphs?
A
7
Q
What are weighted multigraphs?
A
8
Q
What are adjacency, neighbourhood, and degrees in undirected graphs?
A
9
Q
What is the handshaking theorem?
A
10
Q
Example of the handshaking theorem
A
11
Q
What are in-degrees and out-degrees in directed graphs?
A
12
Q
What is the theorem for degrees in directed multigraphs?
A
13
Q
What are complete graphs?
A
14
Q
What is a cycle graph?
A
15
Q
What is a wheel graph?
A
16
Q
What are cube graphs?
A
17
Q
What are bipartite graphs?
A
18
Q
.
A
19
Q
Can a graph with loops be bipartite?
A
20
Q
What is a complete bipartite graphs?
A
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
What are adjacency matrices?
26
What are adjacency matrices for undirected graphs?
27
What are adjacency matrices for directed multigraphs?
28
What are adjacency matrices for undirected multi graphs?
29
.
30
.
31
What are incidence matrices for directed multigraphs?
32
What are incidence matrices for undirected multigraphs?
33
What is graph isomorphisms?
34
Examples of graph isomorphism
35
What is a path in a graph?
36
What are paths for undirected multigraphs?
37
What are paths for directed multigraphs?
38
Examples of path lengths
39
What is undirected connectivity?
40
Examples of undirected connectivity
41
What is directed connectivity?
42
Examples for directed connectivity
43
How do you count paths between vertices
44
What are Euler paths and circuits
45
What are the conditions for Euler paths and circuits for undirected graphs?
46
What are the conditions for Euler paths and circuits for directed graphs?
47
Example of Euler paths
48
What are Hamilton paths and circuits?
49
What are conditions for Hamilton paths and circuits?
50
What is the travelling salesman problem?
