Chapter 2 Vocab list Flashcards

1
Q

Graph

A

collection of vertices & edges.

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

Vertex/Node

A

the dots in a graph (usually where 2 or

more edges meet, but not necessarily).

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

Edge/Arc

A

a line between two vertices.

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

Tree

A

a graph with no cycles.

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

Order (degree) of a vertex

A

the number of edges starting

or finishing at that vertex.

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

Simple graph

A

a graph with no loops or multiple edges.

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

A path

A

a route from one vertex to another which does not repeat any edge.

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

A cycle

A

a route starting and finishing at the same vertex.

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

Connected graph

A

a graph in which there is a route from

each vertex to any other vertex (i.e. the graph is in one part)

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

Complete graph

A

a simple graph in which every pair of

vertices is connected by an edge.

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

Bipartite graph

A

one in which the vertices are in two sets

and each edge has a vertex from each set.

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

Planar graph

A

one which can be drawn with no edges

crossing.

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

Sub graph

A

any set of edges & vertices taken from a

graph is a sub-graph.

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

Di-graph

A

a graph in which the edges indicate direction.

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

Incidence matrix

A

a matrix representing the edges in a

graph.

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

Isomorphic graphs

A

shows same information but drawn differently

17
Q

Adjacency matrix

A

records number of direct links between verticies

18
Q

Distance matrix

A

records the weight on the edges.