Graph theory Flashcards
sub graph
vertex / edge set of original graph
valency / degree / order of a vertex
how many edges connect to that vertex
even degree / odd degree
if no. of edges attaches is even / odd
walk
a route along edges to the next
path
walk which only uses a vertex no more than 1 time
trial
walk that uses no edges more than once
cycle
walk that starts and ends at same vertex but no other vertex is visited more than once
hamiltonian cycle
cycle that includes every vertex
hulerian circuit
trail that starts and ends at the same vertex but uses every edge once
connected graph
every vertex is connected by at least one edge
loop
edge that starts at same vertex
simple graph
no loops, vertices only have 1 edge
directed edges
edges have an associated direction with arrows
directed graphs
have directed edges