Graph And Network Theory Flashcards

1
Q

What is a graph?

A

A graph is a collection of nodes connected by edges.

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

What are the points and lines on a graph called?

A

The lines are called arcs or edges and the point are called nodes or vertices.

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

What is a network?

A

A network is a graph that has numbers assigned to each edge (a weighted graph).

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

What is a digraph?

A

A diagraph is a graph that has arrows on the edges, showing direction.

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

What is a subgraph?

A

Any graph (B) is a subgraph of any graph (A), if all the nodes and edges in B are nodes and edges in A.

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

What is a loop?

A

A loop is an edge that starts and finishes at the same node.

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

What are isomorphic graphs?

A

Isomorphic graphs are where 2 graphs are identical, same degree, same number of nodes and edges.

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

What is the degree of a node or graph?

A

The degree is the number of edges incident to a/each node.

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

What is a simple graph?

A

A graph is simple if it doesn’t have any loops or multiple edges between 2 nodes.

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

What is a walk?

A

A walk is a succession of edges where the end of one is the start of the next.

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

What is a path?

A

A path is a walk where all the nodes are different.

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

What is a closed walk?

A

A closed walk is a walk that starts and ends at the same node.

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

What is a cycle?

A

A cycle is a path that starts and ends at the same node.

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

What is a connected and disconnected graph?

A

If there is a path between any pair of nodes, the graph is connected. A graph is said to be disconnected if there is no path between two nodes causing the graph to be broken into components.

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