WILDCARD
What is a connected graph?
A graph in which each vettex is connected to each other, either directly or indirectly
What is a Network?
A diagram used to show conectionons and they are made up of verticies and edges.
What is a Planar Graph?
A graph that can be drawn with no overlapping edges.
What is a walk?
A continuous sequence of vertices and edges
How do you pronounce 'Eulerian'?
Oil-er-ian*
How many faces are in this graph?
4
what is an vertex?
Points on a Graph.
What is a Face?
An area on a graph bordered by edges
A cycle is also what type of walk?
A path
What is a vertex?
A point on a network
What is this?
A multiple edge
What is an Edge?
A line conecting one vertex to another or itself.
Is this graph Planar?
Yes
List the main 4 types of walks
Path, Trail, Cycle, Circuit
What is the Königsberg Puzzle?
A town has seven bridges and cannot be Eulerian if it is imagined as a graph.
What country is Königsberg in?
Russia
What is the degree of this vertex?
Drawn on the board by georgia.
4
Can a complete graph be planar?
No
What is an Eulerian Trail?
A trail in which every edge is used once.
What is this?
A Loop
What does a co-interior angle add up to? (degrees)
180 degrees
What is a complete Graph?
A graph in which every vertex is conected to every other vertex exactly once.
What is Eulers rule/ formula?
v-e+f=2
What must an Eulerian Trail have?
Exactly 2 vertices of an odd degree
SSS, ASA, SAS, RHS