MATH 314 Study Guide - Midterm Guide: Regular Graph, Complete Graph, Null Graph
16 Oct 2017
School
Department
Course
Professor
Document Summary
It can be thought of as the number of edges that come out of a node. It can be thought of as the number of things you are adjacent to. 4, 3, 2, 2, 2, 1 (degree sequence) There are 6 vertices because there are six numbers. One vertex has 4 edges, one vertex has 3 edges, three vertices have 2 edges, and one vertex has one edge: the sum of all of the degrees of any graph is always an even number. Theorems: theorem 7. 1. 1: in every graph, the number of nodes with odd degree is even, theorem 7. 1. 2: the sum of degrees of all nodes in a graph is twice the number of edges. Examples of paths: a path from a vertex to itself is a cycle. 3: a walk is just a path in which edges/nodes can be repeated. (more of a sequence like.
