AMS 301 Chapter Notes - Chapter 2.1: Leat
28 Feb 2021
School
Department
Course
Professor
Document Summary
Graphs consist of a set of vertices and edges that join different pair of distinct vertices. Two vertices joined by an edge are adjacent graph g:(v, e) Sometimes the edges are ordered pairs of vertices , called directed edges. In a directed graph, all edges are directed. Not possible in this graph as a, b and d must each be paired with c ord. Bipartite graphs can be written with vertices split into left and right sides with all edges going between a left and a right vertex. P w vertices represent branch points in search for unknown letter or word. A set of vertices incident to all edges is called an edge cover. we want a mine edge cover. 3 incident edges (such a vertex has degree 3) 5 vertices could work, we must use either. I degree-2 vertex s degree-3 vertices; one edge is double covered we will use the ac.
