Mathematics Combinatorics Graph Theory Topological Graph Theory David Craft.

Slides:

Advertisements

Similar presentations

Vertex-Edge Graphs.

Advertisements

Shapes of Surfaces Yana Mohanty. Originator of cut and paste teaching method Bill Thurston Fields Medalist, 1982.

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,

Conjunction Junction What’s Your Function?

Gopi -ICS280F02 - Slide 1 Characteristics of an Object.

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.

Planar / Non-Planar Graphs Gabriel Laden CS146 – Spring 2004 Dr. Sin-Min Lee.

Computational Topology for Computer Graphics Klein bottle.

Lecture 1: The Euler characteristic of a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305) Topics in Topology: Scientific.

Planarity and Higher Order Embeddings Shawn Cox CS 594: Graph Theory

Embeddings with all triangles faces Dan Archdeacon The University of Vermont.

3-maps David L. Craft* Muskingum College Arthur T. White Western Michigan University.

Knots and Links - Introduction and Complexity Results Krishnaram Kenthapadi 11/27/2002.

Kerry R. Sipe Aug. 1, 2007 On the Non-Orientable Genus of Zero Divisor Graphs Missouri State University REU.

Kenta Noguchi Keio University Japan 2012/5/301Cycles in Graphs.

From polygons to polyhedra and beyond ST PAUL’S GEOMETRY MASTERCLASS I.

Topology Marianelly Lopez Anita Roman Jose Valencia Joe Williams.

11-1 Space Figures and Cross Sections

1 Introduction to Topological Shape Modeling Part I Overview: What is topology?

Recognizing Strings in NP Marcus Schaefer, Eric Sedgwick, Daniel Štefankovič Presentation by Robert Salazar.

Recognizing String Graphs in NP Marcus Schaefer Eric Sedgwick Daniel Štefankovič.

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

Use intercepts to graph an equation

MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,

Matthew Bowling Euler’s Theorem Mathfest Spring ‘15.

Maps. Graphs on Surfaces We are mainly interested in embeddings of graphs on surfaces:  : G ! S. An embedding should be differentiated from immersion.

© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 10 Geometry.

Bar Graphs Lesson 2-2. Bar Graphs A graph is a visual way to display data. A bar graph is used to compare data.

More Graphs, Subgraphs and Trees Planarity and Coloring.

Cubes, Prisms, Pyramids, Cylinders, Cones and Spheres

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 9.6 Topology.

1 Adding charts anywhere Assume a cow is a sphere Cindy Grimm and John Hughes, “Parameterizing n-holed tori”, Mathematics of Surfaces X, 2003 Cindy Grimm,

Mobius Band By: Katie Neville.

Jeopardy Solid Figures Plane Shapes Cutting Shapes Which Shape Am I? Q $11 Q $22 Q $33 Q $44 Q $55 Q $11Q $11Q $11Q $11 Q $22Q $22Q $22Q $22 Q $33Q $33Q.

Lecture 14: Graph Theory I Discrete Mathematical Structures: Theory and Applications.

On the Uniqueness of the Decomposition of Manifolds, Polyhedra and Continua into Cartesian Products Witold Rosicki (Gdańsk) 6th ECM, Kraków 2012.

Topology By: Jarek Esswein.

ConcepTest Section 12.2 Question 1 Let be the distance above the ground (in feet) of a jump rope x feet from one end after t seconds. The two people turning.

1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.

Chapter 6: Graphs 6.2 The Euler Characteristic. Draw A Graph! Any connected graph you want, but don’t make it too simple or too crazy complicated Only.

Warm Up How many corners does the tissue box have? How many flat surfaces? How many folded creases? Draw a net for the tissue box. Corners: 8 Flat Surfaces:

1 A 4-Dimensional Graph Has at Least 9 Edges Math Colloquium 2015 December 2 Sonoma State University Roger House.

MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles

Joining Can you teach graph theory with this game?

Euler characteristic (simple form):

Planar Graphs prepared and Instructed by Arie Girshson Semester B, 2014 June 2014Planar Graphs1.

Topology Preserving Edge Contraction Paper By Dr. Tamal Dey et al Presented by Ramakrishnan Kazhiyur-Mannar.

Topology and The Euler Number

PIECEWISE FUNCTIONS JOSEPH MONTEMAYOR, XAVIER CONTRERAS, MIROSLAVA JEREZ.

Unit 11 Review Created by Mrs. Martin. 1. List the 6 factors that affect the rate of a reaction.

Lesson: Solids & Cross Sections

Sketching the Derivative

Introduction to Functions

3.1 – Graphing Linear Equations

Subhash Khot Theory Group

Planarity and Euler’s Formula

Graph Theory Unit 2.

Rational Function Discontinuities

Use Stokes' Theorem to evaluate {image} {image} S is a part of the hemisphere {image} that lies inside the cylinder {image} oriented in the direction of.

Function - when every x is paired to one y

14-1 Three-Dimensional Figures and Cross Sections

12.1-D Figures Objective: students will be able to identify the attributes of 3-d figures.

GRAPH THEORY Properties of Planar Graphs Ch9-1.

Mathematics Unit 9: Robberies

GRAPH THEORY Properties of Planar Graphs Ch9-1.

DAGs Longin Jan Latecki

Drawing a graph

Presentation transcript:

Mathematics Combinatorics Graph Theory Topological Graph Theory David Craft

A graph is a set of vertices (or points) together with a set of vertex-pairs called edges.

A graph is a set of vertices (or points) together with a set of vertex-pairs called edges. A graph is a set of vertices (or points) together with a set of vertex-pairs called edges. Graph Theory is the study of graphs.

An imbedding or embedding (or proper drawing) of a graph is one in which edges do not cross.

An imbedding or embedding (or proper drawing) of a graph is one in which edges do not cross. NOT an imbedding

An imbedding or embedding (or proper drawing) of a graph is one in which edges do not cross. NOT an imbeddingAn imbedding

An imbedding or embedding (or proper drawing) of a graph is one in which edges do not cross. NOT an imbeddingAn imbedding Topological Graph Theory is the study of imbeddings of graphs in various surfaces or spaces

Orientable surfaces (without boundary): sphere S 0

Orientable surfaces (without boundary): sphere S 0 torus S 1 Orientable surfaces (without boundary): sphere S 0 torus S 1

Orientable surfaces (without boundary): sphere S 0 torus S 1 2-torus S 2 Orientable surfaces (without boundary): sphere S 0 torus S 1 2-torus S 2

Orientable surfaces (without boundary): sphere S 0 torus S 1 2-torus S 2 n-torus S n Orientable surfaces (without boundary): sphere S 0 torus S 1 2-torus S 2 n-torus S n

Orientable surfaces (without boundary): sphere S 0 torus S 1 2-torus S 2 n-torus S n The surface S n is said to have genus n

Some graphs cannot be imbedded in the sphere… ? ? ?

? ? …but all can be imbedded in in a surface of high enough genus.

The main problem in topological graph theory: Given a graph G, determine the smallest genus n so that G imbeds in S n.

The main problem in topological graph theory: Given a graph G, determine the smallest genus n so that G imbeds in S n. For G =the answer is n = 1.

The main problem in topological graph theory: Given a graph G, determine the smallest genus n so that G imbeds in S n. For G =the answer is n = 1. For G = the answer is n = 3.