Graph theory Flashcards

1
Q

sub graph

A

vertex / edge set of original graph

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

valency / degree / order of a vertex

A

how many edges connect to that vertex

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

even degree / odd degree

A

if no. of edges attaches is even / odd

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

walk

A

a route along edges to the next

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

path

A

walk which only uses a vertex no more than 1 time

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

trial

A

walk that uses no edges more than once

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

cycle

A

walk that starts and ends at same vertex but no other vertex is visited more than once

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

hamiltonian cycle

A

cycle that includes every vertex

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

hulerian circuit

A

trail that starts and ends at the same vertex but uses every edge once

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

connected graph

A

every vertex is connected by at least one edge

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

loop

A

edge that starts at same vertex

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

simple graph

A

no loops, vertices only have 1 edge

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

directed edges

A

edges have an associated direction with arrows

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

directed graphs

A

have directed edges

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