What is Discrete Mathematics? Is it Discrete or Discreet? What does Discrete Mean?

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics
Advertisements

MCA 202: Discrete Mathematics under construction Instructor Neelima Gupta
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
Introduction to Graphs
The 7 Bridges of Konigsberg A puzzle in need of solving.
Section 14.1 Intro to Graph Theory. Beginnings of Graph Theory Euler’s Konigsberg Bridge Problem (18 th c.)  Can one walk through town and cross all.
Introduction This chapter explores graphs and their applications in computer science This chapter explores graphs and their applications in computer science.
Representing Relations Using Matrices
Euler Circuits and Paths
Pamela Leutwyler. A river flows through the town of Konigsburg. 7 bridges connect the 4 land masses. While taking their Sunday stroll, the people of Konigsburg.
IEOR266 © Classification of MCNF problems.
Homework collection Thursday 3/29 Read Pages 160 – 174 Page 185: 1, 3, 6, 7, 8, 9, 12 a-f, 15 – 20.
By Dr. C. B. Alphonce (Room305 Mathematics Building) MT 147: DISCRETE MATHEMATICS (3 Units) CORE for B. SC. In COMPUTER SCIENCE.
Chapter 11 Graphs and Trees This handout: Terminology of Graphs Eulerian Cycles.
Graphs and Trees This handout: Terminology of Graphs Applications of Graphs.
1 Excursions in Modern Mathematics Sixth Edition Peter Tannenbaum.
Chapter 2 Graph Algorithms.
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
It's a world-wide webby wonderland.. Graphs are often used to represent real-world information and real-world structures. Graph Theory was even invented.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.
Lecture 14: Graph Theory I Discrete Mathematical Structures: Theory and Applications.
COSC 2007 Data Structures II Chapter 14 Graphs I.
Unit – V Graph theory. Representation of Graphs Graph G (V, E,  ) V Set of vertices ESet of edges  Function that assigns vertices {v, w} to each edge.
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
Discrete Mathematical Structures: Theory and Applications
MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles
SECTION 5.1: Euler Circuit Problems
Lecture 52 Section 11.2 Wed, Apr 26, 2006
Chapter 6: Graphs 6.1 Euler Circuits
Aim: Graph Theory – Paths & Circuits Course: Math Literacy Do Now: Aim: What are Circuits and Paths? Can you draw this figure without retracing any of.
Chapter 11 - Graph CSNB 143 Discrete Mathematical Structures.
Graph Theory Two Applications D.N. Seppala-Holtzman St. Joseph ’ s College.
1) Find and label the degree of each vertex in the graph.
Graph Theory Euler Paths and Euler Circuits. Euler Paths & Circuits Euler Paths and Euler Circuits (Euler is pronounced the same as Oiler) An Euler path.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 14.1 Graphs, Paths, and Circuits.
CS Lecture 22 Graph Theory. Can I draw the above figure in one continuous trace with no line being drawn twice?
Excursions in Modern Mathematics Sixth Edition
Excursions in Modern Mathematics Sixth Edition
CSNB 143 Discrete Mathematical Structures
Euler and Hamiltonian Graphs
Basic Concepts Graphs For more notes and topics visit:
Task Tables Draw a graph for the following task table.
Euler Paths and Circuits
Konigsberg’s Seven Bridges
Discrete Structures – CNS2300
Spanning Trees Discrete Mathematics.
Discrete Math: Hamilton Circuits
Euler Paths and Circuits
Euler Circuits and Paths
This unit is all about Puzzles Games Strategy.
Introduction to Graph Theory Euler and Hamilton Paths and Circuits
Graph Theory.
Lecture 15: Graph Theory II
Graphs Chapter 13.
Excursions in Modern Mathematics Sixth Edition
Cornell Notes: Euler Paths and Circuits
Euler Circuits and Paths
Discrete Mathematics Lecture 12: Graph Theory
Euler and Hamilton Paths
Section 14.1 Graphs, Paths, and Circuits
Euler Paths and Euler Circuits
CHAPTER 15 Graph Theory.
Graphs, Paths, and Circuits
Warm Up – 3/19 - Wednesday Give the vertex set. Give the edge set.
Chapter 10 Graphs and Trees
Warm Up – 3/14 - Friday 100 seats are to be apportioned.
Graph Vocabulary.
A Survey of Mathematics with Applications
5 The Mathematics of Getting Around
Presentation transcript:

What is Discrete Mathematics? Is it Discrete or Discreet? What does Discrete Mean?

Continuo us Discrete

Can you take a walk so that you cross over each bridge exactly once and wind up back where you started?

It might help to label the land masses so you can represent paths by strings of letters….

In Mathematics we like to abstract away from the details and only show the essentials…. This is an example of a (multi) graph which consists of edges and vertices.

Vertices: A, B, C, D Edges: (AB) 1, (AB) 2, (AC) 1, (AC) 2, (AD), (BD), (C,D). Note: (DA) = (AD) this is not a DiGraph. (AB) 1 (BD)(DC) is a path. (AB) 1 (BD)(DC)(CA) 1 is a cycle. Is there an Euler Cycle? An Euler Path?

What about this town? What if you had time to build one bridge?

Euler Industries 1 is a new computer company that claims to have designed a revolutionary new computer memory. The main memory is broken down into 4 sub-memory cells α, β, δ, and γ. These sub-memories can pass information back and forth along Euler Industries’ new cyberfluxors. There are two cyberfluxors connecting α and β and two cyberfluxors connecting β and δ. The three remaining cyberfluxors connect γ to α, β, and δ, respectively. That is, there is a cyberfluxor between γ and α, one between γ and β and between γ and δ. Each cyberfluxor is capable of carrying information in both directions. Euler Industries’ design depends on one important fact. A given piece of information must be able to pass through each cyberfluxor exactly once. Furthermore, the information must be able to return to the starting cell. Can the computer work or is there a flaw in the design? Compare this problem to the Königsburg Bridge problem. What information is necessary in order to solve each problem and what is extraneous? 1 This problem is reproduced with permission from an exercise written by Michael J. Bardzell.