Chapter 2: Graphs and Networks Flashcards

1
Q

Graph

A

A series of points connected with lines

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

Network

A

A graph which has a quantity

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

Vertex Set

A

A set of vertices, written in {…..}

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

Edge Set

A

A set of edges, written in {…..}

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

Order/Valency/Degree of a vertex

A

How many connections a point has

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

Subgraph

A

A section of graph that has come from the original graph, it can be a small section or the whole thing

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

Cycle

A

A graph/subgraph which starts and ends at the same point

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

Path

A

A sequence of edges where each vertex is used once

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

Walk

A

A path where you can use vertices more than once

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

Connected Graph

A

A graph where every point has an edge to at least one other point

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

Loop

A

An edge that starts and finishes at the same point, Valency of 2

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

Simple Graph

A

No loops, no more than one edge between two points

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

Digraph

A

A graph that has direction

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

Tree

A

A connected graph with no cycles

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

Spanning tree

A

A subgraph which is a tree

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

Bipartite Graph

A

Two sets of vertices, where edges only join between sets and not within their own

17
Q

Complete graph

A

A graph where every point is connected to every other point

18
Q

Isomorphic graphs

A

Graphs which have the same information, ie. they are the same, but are shown differently

19
Q

Adjancency Matrix

A

A matrix which records the number of direct links between vertices

20
Q

Distance matrix

A

A matrix which records the weights on edges