Chapter 15 Graph Theory Flashcards

1
Q

Graph

A

Structure which shows the physical connection or relationship between things of interest

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

Vertices

A

Points on graphs

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

Edges

A

Way to move from one vertex to another

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

Loop

A

an edge from one vertex to itself

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

Adjacent vertices

A

vertices connected by an edge

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

Adjacent edges

A

edges which share a common vertex

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

Degree

A

number of edges connected to a vertex

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

Undirected graph

A

allowed to move on either direction on an edge

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

Directed graph

A

Contain arrows indicating the directions allowed to move in

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

In degree

A

Of a vertex the number of edges coming into the vertex

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

Out degree

A

Of a vertex the number of edges going out from the vertex

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

Simple graph

A

no loops, maximum one edge joining any pair of distinct vertices

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

Subgraph

A

made from subset of vertices and edges within a graph

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

Connected graph

A

Undirected, possible to travel from every vertex to every other vertex by following edges

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

Disconnected graph

A

not possible to travel from every vertex to every other vertex by following edges

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

Strongly connected graph

A

Directed graph, possible to travel from every vertex to every other vertex by following the edges in the right direction

17
Q

Weighted graph

A

Has numbers assigned to edges that represent a certain weight

18
Q

Weighted adjacency table

A

Used to summarise the weights on a graph

19
Q

Complete graph

A

simple undirected graph, in which every vertex is connected to every other vertex by an edge