Chapter 1 Review Homework (MATH 310#3M):

Slides:



Advertisements
Similar presentations
Recursion and Induction
Advertisements

Connectivity - Menger’s Theorem Graphs & Algorithms Lecture 3.
Limitation of Computation Power – P, NP, and NP-complete
Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,
Chapter 9 Graphs.
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Graph-02.
6.896: Topics in Algorithmic Game Theory Lecture 8 Constantinos Daskalakis.
Discrete Math for Computer Science. Mathematical Model Real-world Problem Computerized Solution Abstract Model Transformed Model picture of the real worldpicture.
CompSci 102 Discrete Math for Computer Science April 19, 2012 Prof. Rodger Lecture adapted from Bruce Maggs/Lecture developed at Carnegie Mellon, primarily.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 CHAPTER 4 - PART 2 GRAPHS 1.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 13, Monday, September 29.
Prof. Amr Goneid, AUC1 Analysis & Design of Algorithms (CSCE 321) Prof. Amr Goneid Department of Computer Science, AUC Part R5. Graphs.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 19, Friday, October 17.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 22, Friday, October 24.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 3, Friday, September 5.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 14, Wednesday, October 1.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 15, Friday, October 3.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 16, Monday, October 6.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 11, Wednesday, September 24.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 5,Wednesday, September 10.
CISC220 Fall 2009 James Atlas Nov 13: Graphs, Line Intersections.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 21, Wednesday, October 22.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 6, Friday, September 12.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 4, Monday, September 8.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 20, Monday, October 20.
Discrete Mathematics Lecture 9 Alexander Bukharovich New York University.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
KNURE, Software department, Ph , N.V. Bilous Faculty of computer sciences Software department, KNURE The trees.
Recursion and Induction Themes –Recursion –Recurrence Definitions –Recursive Relations –Induction (prove properties of recursive programs and objects defined.
INCIDENCE GEOMETRIES Part II Further Examples and Properties.
Graph Coloring.
CSC 213 – Large Scale Programming. Today’s Goals  Make Britney sad through my color choices  Revisit issue of graph terminology and usage  Subgraphs,
Week 11 - Wednesday.  What did we talk about last time?  Graphs  Euler paths and tours.
CSNB143 – Discrete Structure Topic 9 – Graph. Learning Outcomes Student should be able to identify graphs and its components. Students should know how.
Chapter 6 Graph Theory R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001.
 2. Region(face) colourings  Definitions 46: A edge of the graph is called a bridge, if the edge is not in any circuit. A connected planar graph is called.
1 12/2/2015 MATH 224 – Discrete Mathematics Formally a graph is just a collection of unordered or ordered pairs, where for example, if {a,b} G if a, b.
September1999 CMSC 203 / 0201 Fall 2002 Week #13 – 18/20/22 November 2002 Prof. Marie desJardins.
Graph.
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.
Graphs and 2-Way Bounding Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois 1 /File:7_bridgesID.png.
Essential Question: How do you solve a system of inequalities by graphing?
Solve by Factoring Zero Product Property.
Lecture 11: 9.4 Connectivity Paths in Undirected & Directed Graphs Graph Isomorphisms Counting Paths between Vertices 9.5 Euler and Hamilton Paths Euler.
Basic properties Continuation
Quadratic Relations Solving Quadratic Equations Day 4: Solve by Quadratic Formula Monday, January 25, 20161Day 4 - Solve by Quadratic Formula.
Chapter 11 - Graph CSNB 143 Discrete Mathematical Structures.
Chapter 20: Graphs. Objectives In this chapter, you will: – Learn about graphs – Become familiar with the basic terminology of graph theory – Discover.
COMPSCI 102 Introduction to Discrete Mathematics.
CSC 252: Algorithms October 28, 2000 Homework #5: Graphs Victoria Manfredi (252a-ad) notes: -Definitions for each of the graph concepts are those presented.
Leda Demos By: Kelley Louie Credits: definitions from Algorithms Lectures and Discrete Mathematics with Algorithms by Albertson and Hutchinson graphics.
Map Coloring Vertex Drawing Txt: mini excursion 2 (p ) & SOL: DM.1 Classwork Project Assigned due in two blocks (print the rubric at the end of.
2.3 Graph Coloring Homework (MATH 310#3W):
Can you draw this picture without lifting up your pen/pencil?
Walks, Paths, and Circuits
Trees L Al-zaid Math1101.
Discrete Mathematics Lecture 13_14: Graph Theory and Tree
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Lecture 5.3: Graph Isomorphism and Paths
Graphs G = (V, E) V are the vertices; E are the edges.
Objectives Classify three-dimensional figures according to their properties. Use nets and cross sections to analyze three-dimensional figures.
Warm Up – Tuesday Find the critical times for each vertex.
Graphing Horizontal and
Section 4.5 The Slope of a Line Goal: Find the slope of a line.
Presentation transcript:

MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 7, Monday, September 15

Chapter 1 Review Homework (MATH 310#3M): Read Supplement I (pp 46-48). Write down a list of all newly introduced terms (printed in boldface or italic) Do Ch.1 Supplement II. Exercises : 4,14,16,20,28,30,36. Volunteers: ____________ Problem: 30.

Example 5: Gray Code Example: n = 3. There are 8 binary sequences: 000 001 010 011 100 101 110 111 There are 2n binary sequences of length n. An ordering of 2n binary sequences with the property that any two consecutive elements differ in exactly one position is called a Gray code.

Hypercube The graph with one vertex for each n-digit binary sequence and an edge joining vertices that correspond to sequences that differ in just one position is called an n-dimensional cube or hypercube. v = 2n e = n 2n-1

4-dimensional Cube. 0110 0010 0111 1110 0011 1010 1011 1111 0001 1101 1001 0000 0100 1100 1000

4-dimensional Cube and a Famous Painting by Salvador Dali Salvador Dali (1904 – 1998) produced in 1954 the Crucifixion (Metropolitan Museum of Art, New York) in which the cross is a 3-dimensional net of a 4-dimensional hypercube.

Gray Code - Revisited 010 011 A Hamilton path in the hypercube produces a Gray code. 111 110 100 101 000 001

2.3 Graph Coloring Homework (MATH 310#3W): Read 2.4. Write down a list of all newly introduced terms (printed in boldface or italic) Do Exercises 2.3: 2,4,6,7,12,14,18 Volunteers: ____________ Problem: 7. On Monday you will also turn in the list of all new terms with the following marks + if you think you do not need the definition on your cheat sheet, check (if you need just the term as a reminder), - if you need more than just the definition to understand the term.

Coloring and Chromatic Number A coloring of a graph G assigns colors to the vertices of G so that adjacent vertices are given different colors. The minimal number of colors required to color a given graph is called the chromatic number of a graph.

Example 1: Simple Graph Coloring Find the chromatic number of the graph on the left.