MATH 105 Lecture Notes - Lecture 1: Eulerian Path
24 Sep 2017
School
Department
Course
Professor
Document Summary
Routing problem - how to deliver services or goods. What is the best way there? ( optimal ) Going through the conditions / requirements means that it is exhaustive. A graph that contains no isolated vertices. In short, not every vertex must connect to each other, but there must be at least one path running through all vertices. A graph without loops or multiple edges. However, say that it is a disconnected graph with only one isolated vertex. Each vertex will be identified by an uppercase letter. If 2 vertices are connected by an edge, they are adjacent. If an edge starts and stops at the same vertex (cannot pass through another. If a vertex has an edge, then it has a degree. Vertex a has a degree of 2. Is a group of vertices connected to each other via edges. Edges - the lines that connect the dots. Vertices are connected to each other with more than one edge.
