unit 5 part 2 Flashcards
initial vertex and final vertex
first and last vertex in walk
internal vertix and terminal vertix
both
not distinct
uv walk
u -> v
closed walk
u -> u coincident vertices
open walk
not closed
trail
open walk, no edge repeated (two arrow directions)
tcpc oc
circuit
closed walk, no edge repeated
path
(open walk) no edge no vertex repeats
path = trail not rev
cycle
(open walk) no edge no vertex repeats
terminal vertex not internal, internal not repeated
cycle = circuit not rev
facts
loop, cycle, simple graph
connected/ disconnected graph
all pair distict vertix connected
planar graph
can be drawn on plane without intersecting edges
euler path
path each edge once, vertex as many
same as graph
max 2 odd vertix degree
euler graph
has euler path, connected
atmost 2 odd degree vertices
euler circuit
1 and last vertex same, path
each even degree vertex