This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Math 4/52021 Exam I Review Exam I will be given in class on Thursday, October 8, 2009 . It will cover Chapters 1 and 2, Homework #1–#4, and material from class through September 29. The problems will be similar to homework problems. Listed below are the basic terminology and results you should be familiar with and the types of problems and skills to be tested. Proofs of basic results related to the listed terminology and theorems may be included. Statements of definitions/theorems and proofs of theorems will not be on the exam. Terminology § 1.1: vertex, edge, graph, adjacent, incident, directed graph, path, circuit, matching, independent set § 1.2: isomorphism (undirected graphs only), degree of a vertex, subgraph, complement, complete graph K n § 1.3: bipartite graph § 1.4: planar graph, plane graph, dual graph, region, complete bipartite graph K m,n § 2.1: cycle, trail, Euler cycle, Euler trail, multigraph, line graph L ( G ) § 2.2: Hamilton circuit, Hamilton path § 2.3: k-coloring, chromatic number...
View Full Document
This note was uploaded on 09/21/2011 for the course ECO 108 taught by Professor Wolman during the Fall '08 term at SUNY Stony Brook.
- Fall '08