class+April1+chapter+5

class+April1+chapter+5 - Math 103, Section 11, Friday,...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Homework to be discussed in class on Tuesday, April 5 , Chapter 5, Page 191, Problems 1,2 5, and 11 Homework for Chapter 5 is due when we finish Chapter 5. Problems 20,26,30,34,38,42 and 46 will be collected and graded. Unicursal tracing- trace each drawing without lifting the pencil or retracing any of the lines. Routing problems- finding ways to deliver goods Existence and how to find the route We will discuss Euler circuit problems-exhaustive routes We will use the tools of Graph theory to solve these problems. What is a graph? Dots are called vertices of the graph and lines are called the edges of the graph A graph is a set of points called vertices and a list of “lines” called edges , connecting some of the vertices. It is possible for an edge to connect a vertex back to itself. These types of edges are called loops. That is, an edge from a vertex to itself is called a loop . It is possible for 2 edges to connect the same pair of vertices. These edges are called multiple edges. Here is a graph. The vertex set V={A,B,C,D,E}
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/20/2012 for the course MATH 103 taught by Professor Berkowitz during the Spring '07 term at Rutgers.

Page1 / 6

class+April1+chapter+5 - Math 103, Section 11, Friday,...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online