math vocab Flashcards
simple graph
undirected, inweighted graph with no loops or multiple edges
connected graph
if every vertex is connetced to every other vertex
complete graphs
simple graph in which every vertex is connected to every other vertex
bridges
when a connected graph becomes disconnected after an edge is removed
digraphs
have directed arcs
walks
a sequence of vertices for which each vertex is connected to the next, a walk may include repeated vertices or edges
path
a walk with no repeated edges or vertices
planar graphs
when it can be drawn in the plane without its edges crossing over
trail
a walk with no repeated edges
cycle
path that starts and ends at the same vertex
eulers rule
vertcies + faces = edges + 2
bipartite graph
no edges join vertices from the same group
completed bipartite
every memeber from each group is connected to every other member of the other group
hamiltonian
visit every vertex once, don’t mind if edges missed
directed graph
has an in and out degree from its vertext