Networks Flashcards
What are cycles?
Routes which form a loop by returning to its original start point.
What are paths?
Routes that do not visit any vertex more than once, and do not go over any edge more than once.
What are simple graphs?
Have no loops and at most one edge connecting any pair of vertices.
What are connected graphs?
All vertices are connected by an edge.
What is a tree?
A connected graph with no cycles.
What is a eulerian trail?
A route which covers every edge of the graph exactly once and finishes at the start vertex. Sometimes called a eulerian cycle.
What does eulerian mean?
Every node is even.
What does semi eulerian mean?
2 nodes are odd.
What does non-eulerian mean?
Every other combination.
What is a planar graph?
A graph that is drawn so that none of the edges cross.
What is a Hamiltonian cycle?
A cycle that visits all of the vertices only once and returns back to the starting point.
What does isomorphic mean?
When 2 graphs have the same amount of vertices and edges.
