unit 5 part 2 Flashcards

1
Q

initial vertex and final vertex

A

first and last vertex in walk

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

internal vertix and terminal vertix

A

both

not distinct

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

uv walk

A

u -> v

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

closed walk

A

u -> u coincident vertices

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

open walk

A

not closed

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

trail

A

open walk, no edge repeated (two arrow directions)

tcpc oc

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

circuit

A

closed walk, no edge repeated

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

path

A

(open walk) no edge no vertex repeats

path = trail not rev

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

cycle

A

(open walk) no edge no vertex repeats
terminal vertex not internal, internal not repeated
cycle = circuit not rev

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

facts

A

loop, cycle, simple graph

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

connected/ disconnected graph

A

all pair distict vertix connected

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

planar graph

A

can be drawn on plane without intersecting edges

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

euler path

A

path each edge once, vertex as many
same as graph
max 2 odd vertix degree

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

euler graph

A

has euler path, connected

atmost 2 odd degree vertices

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

euler circuit

A

1 and last vertex same, path

each even degree vertex

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

euler formula

A

e-v+2, edges around regn -> degree

pendant edge = 2