Chapter 4 Review Math Analysis

Slides:

Advertisements

Similar presentations

Discrete math Objectives: To learn vocabulary, vertex/edge patterns in discrete math. Vertex Edge Graph - A collection of points some of which are joined.

Advertisements

Vertex-Edge Graphs.

Math for Liberal Studies. This graph does not have an Euler circuit. This graph does have an Euler circuit.

Chapter 8 Topics in Graph Theory

2.1 Graphs of Basic Functions and Relations; Symmetry

Hamiltonian Circuits and Paths

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.

1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.

Graphs. Overview What is a graph? Some terminology Types of graph Implementing graphs (briefly) Some graph algorithms Graphs 2/18.

Discrete Structures Chapter 7B Graphs Nurul Amelina Nasharuddin Multimedia Department.

Section 2.3 Graph Coloring By Katie Lessard & Colleen Raimondi.

Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.

The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.

Chapter 4 Graphs.

CSC 2300 Data Structures & Algorithms March 30, 2007 Chapter 9. Graph Algorithms.

Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.

CS 2813 Discrete Structures

9.8 Graph Coloring. Coloring Goal: Pick as few colors as possible so that two adjacent regions never have the same color. See handout.

Graph Theory Topics to be covered:

Chapter 4 sections 1 and 2.  Fig. 1  Not connected  All vertices are even.  Fig. 2  Connected  All vertices are even.

CSNB143 – Discrete Structure Topic 9 – Graph. Learning Outcomes Student should be able to identify graphs and its components. Students should know how.

Page 714 #1-10 ANSWERS Lesson Reflection for Chapter 14 Section 7.

Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.

Planar Graphs Graph Coloring

Introduction to Graph Theory

Class 7: Answers 1 (C) Which of the following matrices below is in reduced row echelon form? A B C D. None of them.

Chapter 6: Graphs 6.1 Euler Circuits

Walks, Paths and Circuits. A graph is a connected graph if it is possible to travel from one vertex to any other vertex by moving along successive edges.

Chapter 11 - Graph CSNB 143 Discrete Mathematical Structures.

Vertex Edge Graphs. What is a vertex-edge graph?  A collection of points, some of which are joined by line segments or curves  Examples:

1) Find and label the degree of each vertex in the graph.

Chapter 10.8 Graph Coloring These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7 th ed., by Kenneth.

Copyright © 2009 Pearson Education, Inc. Chapter 14 Section 1 – Slide Graph Theory Graphs, Paths & Circuits.

Homework 8 Graph G is given by the figure below.

CSNB 143 Discrete Mathematical Structures

Redraw these graphs so that none of the line intersect except at the vertices B C D E F G H.

2.3 Graph Coloring Homework (MATH 310#3W):

Task Tables Draw a graph for the following task table.

Discrete Structures – CNS2300

Planar Graphs & Euler’s Formula

Spanning Trees Discrete Mathematics.

Can you draw this picture without lifting up your pen/pencil?

Euler Paths and Circuits

! Review for euler graphs WIN a FREE HW PASS or bonus point for FRIDAY’s quiz!!!!!!

Chapter 10.8 Graph Coloring

"Learning how to learn is life's most important skill. " - Tony Buzan

Walks, Paths, and Circuits

Chapter 10.8 Graph Coloring

Chapter 10.8 Graph Coloring

A path that uses every vertex of the graph exactly once.

Hamiltonian Circuits and Paths

3.1 Earliest Start Times.

Cornell Notes: Euler Paths and Circuits

Hamiltonian Circuits and Paths Vocabulary

Discrete math Objectives: To learn vocabulary, vertex/edge patterns in discrete math. Vertex Edge Graph - A collection of points some of which are joined.

Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.

Chapter 10.8 Graph Coloring

Chapter Seven Constructions and Scale Drawings

Graphs G = (V, E) V are the vertices; E are the edges.

GRAPHS G=<V,E> Adjacent vertices Undirected graph

! Review for euler graphs WIN a FREE HW PASS or bonus point for FRIDAY’s quiz!!!!!!

Euler circuit Theorem 1 If a graph G has an Eulerian path, then it must have exactly two odd vertices. Theorem 2 If a graph G has an Eulerian circuit,

CHAPTER 15 Graph Theory.

Warm Up – 3/19 - Wednesday Give the vertex set. Give the edge set.

Mathematics Code Breaker

Hamilton Paths and Circuits

Warm Up – 3/17 - Monday A) List the set of vertices.

Presentation transcript:

Chapter 4 Review Math Analysis “Stick It To ‘Em”

Complete the task table for the graph below:

Task Table: TASK TIME PREREQUISITES Start None A B C D E F G H Finish

Task Table: TASK TIME PREREQUISITES Start None A 5 B 4 C 6 D 7 E 8 None A 5 B 4 C 6 D 7 E 8 B, C F D, E G 1 H 3 F, G Finish

Represent the following graph with an adjacency matrix

List the following as a set of vertices and edges

Fill in the blanks: A) The degree of each vertex of a K4 graph is ______ B) The degree of each vertex of a Kn graph is ______

Use the graph below to answer the questions A) Write as a set of vertices and ordered edges B) Does the graph have an Euler circuit? Explain.

Find a Hamiltonian Circuit for the following graph:

Using the CONDORCET method construct a cumulative preference schedule that would show the overall results of the four individual preference schedules

Construct an Adjacency Matrix for the following graph:

What is the chromatic number for the following graphs? A) B)