Definitions - Graph Theory Flashcards

0
Q

Vertices

A

Dots in graph

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

Graph

A

Set of vertices and edges that end on a vertex

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

Edges

A

Connecting lines in graph

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

Adjacent vertices

A

Vertices that share common edge

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

Degree

A

Number of edges joining vertex

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

Size

A

Number of vertices

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

Connected graph

A

There is a way to get from one vertex to another

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

Loop

A

Start/finish at same vertex

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

Multiple edges

A

Vertices have multiple connecting edges

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

Simple graph

A

No multiple edges or loops

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

Regular graph

A

All vertices have same degree

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

Tree

A

Graph is connected. No circuits

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

Isomorphic graphs

A

First graph can be reconstructed by moving vertices of second graph

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

Walk

A

Sequence of edges and vertices

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

Closed walk

A

End of walk vertex is the same as starting vertex

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

Path

A

No edge travelled more than once

16
Q

Chain

A

No vertex visited more than once

17
Q

Closed path/circuit/cycle

A

Path that starts/ends on same vertex

18
Q

Girth

A

Length of shortest circuit

19
Q

Hamiltonian circuit

A

Circuit that starts at vertex, passes through all vertices once and returns to dip starting vertex

20
Q

Eulerian path

A

Path that contains every edge once

21
Q

Eulerian circuit

A

Eulerian path that starts/ends on same vertex