Planar Graph and Trees


 Osborne Hunt
 1 years ago
 Views:
Transcription
1 Dr. Nahid Sultana December 16, 2012
2 Tree Spanning Trees Minimum Spanning Trees Maps and Regions Eulers Formula Nonplanar graph Dual Maps and the Four Color Theorem
3 Tree Spanning Trees Minimum Spanning Trees A graph T is called a tree if T is connected and T has no cycles. Example: Tree Forest 5 leaves 4 leaves
4 Tree Spanning Trees Minimum Spanning Trees A graph T is called a tree if T is connected and T has no cycles. Example: Tree Forest 5 leaves 4 leaves If every connected component of a graph G is a tree, then G is called a forest.
5 Tree Spanning Trees Minimum Spanning Trees A graph T is called a tree if T is connected and T has no cycles. Example: Tree Forest 5 leaves 4 leaves If every connected component of a graph G is a tree, then G is called a forest. A graph without cycles is called cyclefree. The tree consisting of a single vertex with no edges is called the degenerate tree.
6 Tree Spanning Trees Minimum Spanning Trees A graph T is called a tree if T is connected and T has no cycles. Example: Tree Forest 5 leaves 4 leaves If every connected component of a graph G is a tree, then G is called a forest. A graph without cycles is called cyclefree. The tree consisting of a single vertex with no edges is called the degenerate tree. A leaf is a vertex with degree 1 in a tree (or forest).
7 Tree Spanning Trees Minimum Spanning Trees Every tree has the following properties: 1. There is a unique simple path between every pair of vertices. 2. Adding an edge between nonadjacent vertices in a tree creates a graph with a cycle. 3. Removing any edge disconnects the graph. 4. If the tree has at least two vertices, then it has at least two leaves. 5. The number of vertices in a tree is one larger than the number of edges.
8 Tree Spanning Trees Minimum Spanning Trees A subgraph T of a connected graph G is called a spanning tree of G if T is a tree and T includes all the vertices of G.
9 Tree Spanning Trees Minimum Spanning Trees A subgraph T of a connected graph G is called a spanning tree of G if T is a tree and T includes all the vertices of G. Example: A connected graph with a spanning tree highlighted.
10 Tree Spanning Trees Minimum Spanning Trees A subgraph T of a connected graph G is called a spanning tree of G if T is a tree and T includes all the vertices of G. Example: A connected graph with a spanning tree highlighted. Theorem: Every connected graph contains a spanning tree.
11 Tree Spanning Trees Minimum Spanning Trees A minimal spanning tree (MST) of a connected weighted graph G is the spanning tree of G with the smallest possible sum of edge weights.
12 Tree Spanning Trees Minimum Spanning Trees A minimal spanning tree (MST) of a connected weighted graph G is the spanning tree of G with the smallest possible sum of edge weights. Find MST T of a connected graph G with n vertices: notice that T must have n 1 edges. There are two algorithms: Algorithm 1: 1. Arrange the edges in the order of decreasing weights 2. Proceeding sequentially, delete each edge that does not disconnect the graph until n 1 edges remain. Example: In class
13 Tree Spanning Trees Minimum Spanning Trees Algorithm 2: 1. Arrange the edges in the order of increasing weights 2. Starting with only with the vertices and proceeding sequentially, add each edge which does not result in a cycle until n 1 edges are added. Example: In class
14 Tree Spanning Trees Minimum Spanning Trees Algorithm 2: 1. Arrange the edges in the order of increasing weights 2. Starting with only with the vertices and proceeding sequentially, add each edge which does not result in a cycle until n 1 edges are added. Example: In class The weight of a MST is unique, but the MST itself is not. Different MST can occur when two or more edges have the same weight.
15 Maps and Regions Eulers Formula Nonplanar graph A graph/multigraph which can be drawn in the plane so that its edges do not cross is said to be planar.
16 Maps and Regions Eulers Formula Nonplanar graph A graph/multigraph which can be drawn in the plane so that its edges do not cross is said to be planar. Example:
17 Maps and Regions Eulers Formula Nonplanar graph A particular planar representation of a planar graph is called a map. A map divides the plane into a number of regions or faces.
18 Maps and Regions Eulers Formula Nonplanar graph A particular planar representation of a planar graph is called a map. A map divides the plane into a number of regions or faces. Example: the planar graph of K 4 has 4 regions, one of which is exterior to the graph.
19 Maps and Regions Eulers Formula Nonplanar graph A particular planar representation of a planar graph is called a map. A map divides the plane into a number of regions or faces. Example: the planar graph of K 4 has 4 regions, one of which is exterior to the graph. Degree of a region r, written deg(r), is the length of the cycle or closed path which borders r.
20 Maps and Regions Eulers Formula Nonplanar graph A particular planar representation of a planar graph is called a map. A map divides the plane into a number of regions or faces. Example: the planar graph of K 4 has 4 regions, one of which is exterior to the graph. Degree of a region r, written deg(r), is the length of the cycle or closed path which borders r. Theorem: The sum of the degrees of the regions of a map is equal to twice the number of edges.
21 Maps and Regions Eulers Formula Nonplanar graph Example:
22 Maps and Regions Eulers Formula Nonplanar graph Example: The borders of all regions are cycles except for r 3. But if we start at the vertex C and move counterclockwise around r 3, then we obtain the closed path: (C, D, E, F, E, C) where the edge {E, F } occurs twice.
23 Maps and Regions Eulers Formula Nonplanar graph Example: The borders of all regions are cycles except for r 3. But if we start at the vertex C and move counterclockwise around r 3, then we obtain the closed path: (C, D, E, F, E, C) where the edge {E, F } occurs twice. deg(r 1 ) = 3,deg(r 2 ) = 3,deg(r 3 ) = 5,deg(r 4 ) = 4,deg(r 5 ) = 3. The sum of the degrees is 18, which is twice the number of edges.
24 Maps and Regions Eulers Formula Nonplanar graph Theorem: Let G = (V, E) be a connected planar graph, and let v = V, e = E, and r = number of regions. Then: v e + r = 2.
25 Maps and Regions Eulers Formula Nonplanar graph Theorem: Let G = (V, E) be a connected planar graph, and let v = V, e = E, and r = number of regions. Then: Example: v e + r = 2.
26 Maps and Regions Eulers Formula Nonplanar graph Theorem: Let G = (V, E) be a connected planar graph, and let v = V, e = E, and r = number of regions. Then: Example: v e + r = 2. Here v = 6, e = 9, and r = 5. And v e + r = = 2, as expected.
27 Maps and Regions Eulers Formula Nonplanar graph Theorem: Suppose a connected planar graph has v 3 vertices and e edges, then e 3v 6.
28 Maps and Regions Eulers Formula Nonplanar graph Theorem: Suppose a connected planar graph has v 3 vertices and e edges, then e 3v 6. Is K 5 planar?
29 Maps and Regions Eulers Formula Nonplanar graph Theorem: Suppose a connected planar graph has v 3 vertices and e edges, then e 3v 6. Is K 5 planar? A graph is called complete bipartite graph if its vertices V can be partitioned into two subsets M and N such that each vertex of M is connected to each vertex of N, denoted by K m,n, where m = M and n = N. Example:
30 Maps and Regions Eulers Formula Nonplanar graph Theorem: The following properties of a graph are equivalent (that is, if the graph has any one of the properties, then it has all of the properties): 1. The graph is bipartite. 2. The graph does not contain any cycles with odd length. 3. The graph does not contain any closed paths with odd length.
31 Maps and Regions Eulers Formula Nonplanar graph Theorem: The following properties of a graph are equivalent (that is, if the graph has any one of the properties, then it has all of the properties): 1. The graph is bipartite. 2. The graph does not contain any cycles with odd length. 3. The graph does not contain any closed paths with odd length. K 3,3 is not planar.
32 Maps and Regions Eulers Formula Nonplanar graph Theorem: The following properties of a graph are equivalent (that is, if the graph has any one of the properties, then it has all of the properties): 1. The graph is bipartite. 2. The graph does not contain any cycles with odd length. 3. The graph does not contain any closed paths with odd length. K 3,3 is not planar. Theorem: (Kuratowski) A graph is nonplanar iff it contains a subgraph homeomorphic to K 3,3 or K 5.
33 Dual Maps and the Four Color Theorem A Vertex coloring or simply coloring of a given graph G is an assignment of colors to the vertices of G such that adjacent vertices have different colors.
34 Dual Maps and the Four Color Theorem A Vertex coloring or simply coloring of a given graph G is an assignment of colors to the vertices of G such that adjacent vertices have different colors. A graph G is ncolorable if there exists a coloring of G which uses n colors.
35 Dual Maps and the Four Color Theorem A Vertex coloring or simply coloring of a given graph G is an assignment of colors to the vertices of G such that adjacent vertices have different colors. A graph G is ncolorable if there exists a coloring of G which uses n colors. The minimum number of colors needed to paint G is called the chromatic number of G and is denoted by χ(g). Example in Class.
36 Dual Maps and the Four Color Theorem Example: Find the chromatic number of the bipartite graph K 2,4.
37 Dual Maps and the Four Color Theorem Example: Find the chromatic number of the bipartite graph K 2,4. Theorem: The following are equivalent for a graph G: 1. G is 2colorable. 2. G is bipartite. 3. Every cycle of G has even length.
38 Dual Maps and the Four Color Theorem Consider a map M (planar representation of a planar graph/multigraph), Two regions of M are said to be adjacent if they have an edge in common.
39 Dual Maps and the Four Color Theorem Consider a map M (planar representation of a planar graph/multigraph), Two regions of M are said to be adjacent if they have an edge in common. Example:
40 Dual Maps and the Four Color Theorem Consider a map M (planar representation of a planar graph/multigraph), Two regions of M are said to be adjacent if they have an edge in common. Example: By a coloring of M we mean an assignment of a color to each region of M such that adjacent regions have different colors. A map M is ncolorable if there exists a coloring of M which uses n colors.
41 Dual Maps and the Four Color Theorem Consider a map M. In each region of M we choose a point, and if two regions have an edge in common then we connect the corresponding points with a curve through the common edge. These curves can be drawn so that they are noncrossing. Thus we obtain a new map M, called the dual of M, such that each vertex of M corresponds to exactly one region of M.
42 Dual Maps and the Four Color Theorem Example: Find the map which is dual to the following maps:
43 Dual Maps and the Four Color Theorem Example: Find the map which is dual to the following maps: Four Color Theorem (Appel and Haken): If the regions of any map M are colored so that adjacent regions have different colors, then no more than four colors are required.
44 in class.
45 The weight of a cycle in a given weighted graph G is defined as the sum of the weights of the edges in the cycle.
46 The weight of a cycle in a given weighted graph G is defined as the sum of the weights of the edges in the cycle. Now suppose we want to find a Hamiltonian cycle that has least possible weight. This is a very famous optimization problem known as the Traveling Salesperson Problem.
47 The weight of a cycle in a given weighted graph G is defined as the sum of the weights of the edges in the cycle. Now suppose we want to find a Hamiltonian cycle that has least possible weight. This is a very famous optimization problem known as the Traveling Salesperson Problem. Theorem: The complete graph K n contains (n 1)! 2 Hamiltonian cycles.
48 The weight of a cycle in a given weighted graph G is defined as the sum of the weights of the edges in the cycle. Now suppose we want to find a Hamiltonian cycle that has least possible weight. This is a very famous optimization problem known as the Traveling Salesperson Problem. Theorem: The complete graph K n contains (n 1)! 2 Hamiltonian cycles. Example:
49 In class.
Planarity Planarity
Planarity 8.1 71 Planarity Up until now, graphs have been completely abstract. In Topological Graph Theory, it matters how the graphs are drawn. Do the edges cross? Are there knots in the graph structure?
More informationDefinition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing:
1. GRAPHS AND COLORINGS Definition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing: 3 vertices 3 edges 4 vertices 4 edges 4 vertices 6 edges A graph
More informationBasic Notions on Graphs. Planar Graphs and Vertex Colourings. Joe Ryan. Presented by
Basic Notions on Graphs Planar Graphs and Vertex Colourings Presented by Joe Ryan School of Electrical Engineering and Computer Science University of Newcastle, Australia Planar graphs Graphs may be drawn
More informationGraph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902
Graph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902 http://www.ms.uky.edu/~mschreffler Different Graphs, Similar Properties
More informationSum of Degrees of Vertices Theorem
Sum of Degrees of Vertices Theorem Theorem (Sum of Degrees of Vertices Theorem) Suppose a graph has n vertices with degrees d 1, d 2, d 3,...,d n. Add together all degrees to get a new number d 1 + d 2
More informationHOMEWORK #3 SOLUTIONS  MATH 3260
HOMEWORK #3 SOLUTIONS  MATH 3260 ASSIGNED: FEBRUARY 26, 2003 DUE: MARCH 12, 2003 AT 2:30PM (1) Show either that each of the following graphs are planar by drawing them in a way that the vertices do not
More informationChapter 6: Colouring Graphs
17 Coloring Vertices Chapter 6: Colouring Graphs 1. Sections 1719: Qualitative (Can we color a graph with given colors?) Section 20: Quantitative (How many ways can the coloring be done?) 2. Definitions:
More informationGraph Theory. Introduction. Distance in Graphs. Trees. Isabela Drămnesc UVT. Computer Science Department, West University of Timişoara, Romania
Graph Theory Introduction. Distance in Graphs. Trees Isabela Drămnesc UVT Computer Science Department, West University of Timişoara, Romania November 2016 Isabela Drămnesc UVT Graph Theory and Combinatorics
More informationSolutions to Exercises 8
Discrete Mathematics Lent 2009 MA210 Solutions to Exercises 8 (1) Suppose that G is a graph in which every vertex has degree at least k, where k 1, and in which every cycle contains at least 4 vertices.
More informationIntroduction to Graph Theory
Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate
More informationCS311H. Prof: Peter Stone. Department of Computer Science The University of Texas at Austin
CS311H Prof: Department of Computer Science The University of Texas at Austin Good Morning, Colleagues Good Morning, Colleagues Are there any questions? Logistics Class survey Logistics Class survey Homework
More informationAbout the Tutorial. Audience. Prerequisites. Disclaimer & Copyright
About the Tutorial This tutorial offers a brief introduction to the fundamentals of graph theory. Written in a readerfriendly style, it covers the types of graphs, their properties, trees, graph traversability,
More informationFall 2015 Midterm 1 24/09/15 Time Limit: 80 Minutes
Math 340 Fall 2015 Midterm 1 24/09/15 Time Limit: 80 Minutes Name (Print): This exam contains 6 pages (including this cover page) and 5 problems. Enter all requested information on the top of this page,
More informationSocial Media Mining. Graph Essentials
Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures
More informationChapter 6 Planarity. Section 6.1 Euler s Formula
Chapter 6 Planarity Section 6.1 Euler s Formula In Chapter 1 we introduced the puzzle of the three houses and the three utilities. The problem was to determine if we could connect each of the three utilities
More informationMGF 1107 CH 15 LECTURE NOTES Denson. Section 15.1
1 Section 15.1 Consider the house plan below. This graph represents the house. Consider the mail route below. This graph represents the mail route. 2 Definitions 1. Graph a structure that describes relationships.
More informationPlanar Graphs and Graph Coloring
Planar Graphs and Graph Coloring Margaret M. Fleck 1 December 2010 These notes cover facts about graph colorings and planar graphs (sections 9.7 and 9.8 of Rosen) 1 Introduction So far, we ve been looking
More informationChapter 4: Trees. 2. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:
9 Properties of Trees. Definitions: Chapter 4: Trees forest  a graph that contains no cycles tree  a connected forest. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:
More informationCHAPTER 2 GRAPHS F G C D
page 1 of Section 2.1 HPTR 2 GRPHS STION 1 INTROUTION basic terminology graph is a set of finitely many points called vertices which may be connected by edges. igs 1 3 show three assorted graphs. v1 v2
More information1 Plane and Planar Graphs. Definition 1 A graph G(V,E) is called plane if
Plane and Planar Graphs Definition A graph G(V,E) is called plane if V is a set of points in the plane; E is a set of curves in the plane such that. every curve contains at most two vertices and these
More informationV. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005
V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer
More informationChapter 8 Independence
Chapter 8 Independence Section 8.1 Vertex Independence and Coverings Next, we consider a problem that strikes close to home for us all, final exams. At the end of each term, students are required to take
More informationClass One: Degree Sequences
Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of
More information6. Planarity. Fig Fig. 6.2
6. Planarity Let G(V, E) be a graph with V = {v 1, v 2,..., v n } and E = {e 1, e 2,..., e m }. Let S be any surface (like the plane, sphere) and P = {p 1, p 2,..., p n } be a set of n distinct points
More informationEuler Paths and Euler Circuits
Euler Paths and Euler Circuits An Euler path is a path that uses every edge of a graph exactly once. An Euler circuit is a circuit that uses every edge of a graph exactly once. An Euler path starts and
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Week 9 Lecture Notes Graph Theory For completeness I have included the definitions from last week s lecture which we will be using in today s lecture along with
More informationColoring Eulerian triangulations of the projective plane
Coloring Eulerian triangulations of the projective plane Bojan Mohar 1 Department of Mathematics, University of Ljubljana, 1111 Ljubljana, Slovenia bojan.mohar@unilj.si Abstract A simple characterization
More informationMinimum Spanning Trees
Minimum Spanning Trees Algorithms and 18.304 Presentation Outline 1 Graph Terminology Minimum Spanning Trees 2 3 Outline Graph Terminology Minimum Spanning Trees 1 Graph Terminology Minimum Spanning Trees
More informationChapter 4. Trees. 4.1 Basics
Chapter 4 Trees 4.1 Basics A tree is a connected graph with no cycles. A forest is a collection of trees. A vertex of degree one, particularly in a tree, is called a leaf. Trees arise in a variety of applications.
More informationPolygon Triangulation. O Rourke, Chapter 1
Polygon Triangulation O Rourke, Chapter 1 Outline Triangulation Duals Three Coloring Art Gallery Problem Definition A (simple) polygon is a region of the plane bounded by a finite collection of line segments
More informationDiscrete Mathematics Problems
Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 Email: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................
More information(Vertex) Colorings. We can properly color W 6 with. colors and no fewer. Of interest: What is the fewest colors necessary to properly color G?
Vertex Coloring 2.1 33 (Vertex) Colorings Definition: A coloring of a graph G is a labeling of the vertices of G with colors. [Technically, it is a function f : V (G) {1, 2,...,l}.] Definition: A proper
More informationWeek 2 Polygon Triangulation
Week 2 Polygon Triangulation What is a polygon? Last week A polygonal chain is a connected series of line segments A closed polygonal chain is a polygonal chain, such that there is also a line segment
More informationCOLORED GRAPHS AND THEIR PROPERTIES
COLORED GRAPHS AND THEIR PROPERTIES BEN STEVENS 1. Introduction This paper is concerned with the upper bound on the chromatic number for graphs of maximum vertex degree under three different sets of coloring
More informationGraph definition Degree, in, out degree, oriented graph. Complete, regular, bipartite graph. Graph representation, connectivity, adjacency.
Mária Markošová Graph definition Degree, in, out degree, oriented graph. Complete, regular, bipartite graph. Graph representation, connectivity, adjacency. Isomorphism of graphs. Paths, cycles, trials.
More information7. Colourings. 7.1 Vertex colouring
7. Colourings Colouring is one of the important branches of graph theory and has attracted the attention of almost all graph theorists, mainly because of the four colour theorem, the details of which can
More informationDO NOT REDISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 04 Graph Theory Homework 7 Solutions April 3, 03 Introduction to Graph Theory, West Section 5. 0, variation of 5, 39 Section 5. 9 Section 5.3 3, 8, 3 Section 7. Problems you should
More information9.1. Vertex colouring. 9. Graph colouring. Vertex colouring.
Vertex colouring. 9. Graph colouring kvertexcritical graphs Approximation algorithms Upper bounds for the vertex chromatic number Brooks Theorem and Hajós Conjecture Chromatic Polynomials Colouring of
More informationCSE 20: Discrete Mathematics for Computer Science. Prof. Miles Jones. Today s Topics: Graphs. The Internet graph
Today s Topics: CSE 0: Discrete Mathematics for Computer Science Prof. Miles Jones. Graphs. Some theorems on graphs. Eulerian graphs Graphs! Model relations between pairs of objects The Internet graph!
More information2.3 Scheduling jobs on identical parallel machines
2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed
More informationOn planar regular graphs degree three without Hamiltonian cycles 1
On planar regular graphs degree three without Hamiltonian cycles 1 E. Grinbergs Computing Centre of Latvian State University Abstract. Necessary condition to have Hamiltonian cycle in planar graph is given.
More informationChapter 6: Graph Theory
Chapter 6: Graph Theory Graph theory deals with routing and network problems and if it is possible to find a best route, whether that means the least expensive, least amount of time or the least distance.
More information(a) (b) (c) Figure 1 : Graphs, multigraphs and digraphs. If the vertices of the leftmost figure are labelled {1, 2, 3, 4} in clockwise order from
4 Graph Theory Throughout these notes, a graph G is a pair (V, E) where V is a set and E is a set of unordered pairs of elements of V. The elements of V are called vertices and the elements of E are called
More informationHomework 13 Solutions. X(n) = 3X(n 1) + 5X(n 2) : n 2 X(0) = 1 X(1) = 2. Solution: First we find the characteristic equation
Homework 13 Solutions PROBLEM ONE 1 Solve the recurrence relation X(n) = 3X(n 1) + 5X(n ) : n X(0) = 1 X(1) = Solution: First we find the characteristic equation which has roots r = 3r + 5 r 3r 5 = 0,
More informationGRAPH THEORY and APPLICATIONS. Trees
GRAPH THEORY and APPLICATIONS Trees Properties Tree: a connected graph with no cycle (acyclic) Forest: a graph with no cycle Paths are trees. Star: A tree consisting of one vertex adjacent to all the others.
More information/ Approximation Algorithms Lecturer: Michael Dinitz Topic: Steiner Tree and TSP Date: 01/29/15 Scribe: Katie Henry
600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Steiner Tree and TSP Date: 01/29/15 Scribe: Katie Henry 2.1 Steiner Tree Definition 2.1.1 In the Steiner Tree problem the input
More informationOutline. NPcompleteness. When is a problem easy? When is a problem hard? Today. Euler Circuits
Outline NPcompleteness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2pairs sum vs. general Subset Sum Reducing one problem to another Clique
More informationTrees and Fundamental Circuits
Trees and Fundamental Circuits Tree A connected graph without any circuits. o must have at least one vertex. o definition implies that it must be a simple graph. o only finite trees are being considered
More informationHomework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS
Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS 1.1.25 Prove that the Petersen graph has no cycle of length 7. Solution: There are 10 vertices in the Petersen graph G. Assume there is a cycle C
More information6. GRAPH AND MAP COLOURING
6. GRPH ND MP COLOURING 6.1. Graph Colouring Imagine the task of designing a school timetable. If we ignore the complications of having to find rooms and teachers for the classes we could propose the following
More information(Knight) 3 : A Graphical Perspective of the Knight's Tour on a MultiLayered Chess Board
Bridgewater State University Virtual Commons  Bridgewater State University Honors Program Theses and Projects Undergraduate Honors Program 522016 (Knight) 3 : A Graphical Perspective of the Knight's
More information1 Basic Definitions and Concepts in Graph Theory
CME 305: Discrete Mathematics and Algorithms 1 Basic Definitions and Concepts in Graph Theory A graph G(V, E) is a set V of vertices and a set E of edges. In an undirected graph, an edge is an unordered
More informationWhen is a graph planar?
When is a graph planar? Theorem(Euler, 1758) If a plane multigraph G with k components has n vertices, e edges, and f faces, then n e + f = 1 + k. Corollary If G is a simple, planar graph with n(g) 3,
More informationPlanar Graphs. Complement to Chapter 2, The Villas of the Bellevue
Planar Graphs Complement to Chapter 2, The Villas of the Bellevue In the chapter The Villas of the Bellevue, Manori gives Courtel the following definition. Definition A graph is planar if it can be drawn
More information4 Basics of Trees. Petr Hliněný, FI MU Brno 1 FI: MA010: Trees and Forests
4 Basics of Trees Trees, actually acyclic connected simple graphs, are among the simplest graph classes. Despite their simplicity, they still have rich structure and many useful application, such as in
More informationIn the next theorem, a graph is ddegenerate if it has no subgraph of minimum degree at least d.
6 Planar Graphs Roughly speaking, a graph is planar if and only if it can be drawn in the plane without any two of its edges crossing. More formally, an embedding of a graph G =(V; E) isa function f :
More information1. Relevant standard graph theory
Color identical pairs in 4chromatic graphs Asbjørn Brændeland I argue that, given a 4chromatic graph G and a pair of vertices {u, v} in G, if the color of u equals the color of v in every 4coloring
More informationLecture 4: The Chromatic Number
Introduction to Graph Theory Instructor: Padraic Bartlett Lecture 4: The Chromatic Number Week 1 Mathcamp 2011 In our discussion of bipartite graphs, we mentioned that one way to classify bipartite graphs
More informationHomework 15 Solutions
PROBLEM ONE (Trees) Homework 15 Solutions 1. Recall the definition of a tree: a tree is a connected, undirected graph which has no cycles. Which of the following definitions are equivalent to this definition
More informationComputational Geometry
Motivation 1 Motivation Polygons and visibility Visibility in polygons Triangulation Proof of the Art gallery theorem Two points in a simple polygon can see each other if their connecting line segment
More informationIE 680 Special Topics in Production Systems: Networks, Routing and Logistics*
IE 680 Special Topics in Production Systems: Networks, Routing and Logistics* Rakesh Nagi Department of Industrial Engineering University at Buffalo (SUNY) *Lecture notes from Network Flows by Ahuja, Magnanti
More informationChapter 2. Basic Terminology and Preliminaries
Chapter 2 Basic Terminology and Preliminaries 6 Chapter 2. Basic Terminology and Preliminaries 7 2.1 Introduction This chapter is intended to provide all the fundamental terminology and notations which
More informationSAMPLES OF HIGHER RATED WRITING: LAB 5
SAMPLES OF HIGHER RATED WRITING: LAB 5 1. Task Description Lab report 5. (April 14) Graph Coloring. Following the guidelines, and keeping in mind the assessment criteria, using where appropriate experimental
More informationCMSC 451: Graph Properties, DFS, BFS, etc.
CMSC 451: Graph Properties, DFS, BFS, etc. Slides By: Carl Kingsford Department of Computer Science University of Maryland, College Park Based on Chapter 3 of Algorithm Design by Kleinberg & Tardos. Graphs
More information136 CHAPTER 4. INDUCTION, GRAPHS AND TREES
136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics
More informationGraph. Consider a graph, G in Fig Then the vertex V and edge E can be represented as:
Graph A graph G consist of 1. Set of vertices V (called nodes), (V = {v1, v2, v3, v4...}) and 2. Set of edges E (i.e., E {e1, e2, e3...cm} A graph can be represents as G = (V, E), where V is a finite and
More informationUPPER BOUNDS ON THE L(2, 1)LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE
UPPER BOUNDS ON THE L(2, 1)LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE ANDREW LUM ADVISOR: DAVID GUICHARD ABSTRACT. L(2,1)labeling was first defined by Jerrold Griggs [Gr, 1992] as a way to use graphs
More informationCSL851: Algorithmic Graph Theory Semester I Lecture 1: July 24
CSL851: Algorithmic Graph Theory Semester I 20132014 Lecture 1: July 24 Lecturer: Naveen Garg Scribes: Suyash Roongta Note: LaTeX template courtesy of UC Berkeley EECS dept. Disclaimer: These notes have
More informationGraphs and Network Flows IE411 Lecture 1
Graphs and Network Flows IE411 Lecture 1 Dr. Ted Ralphs IE411 Lecture 1 1 References for Today s Lecture Required reading Sections 17.1, 19.1 References AMO Chapter 1 and Section 2.1 and 2.2 IE411 Lecture
More informationCS268: Geometric Algorithms Handout #5 Design and Analysis Original Handout #15 Stanford University Tuesday, 25 February 1992
CS268: Geometric Algorithms Handout #5 Design and Analysis Original Handout #15 Stanford University Tuesday, 25 February 1992 Original Lecture #6: 28 January 1991 Topics: Triangulating Simple Polygons
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 10: Graphs
Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph
More informationCMPSCI611: Approximating MAXCUT Lecture 20
CMPSCI611: Approximating MAXCUT Lecture 20 For the next two lectures we ll be seeing examples of approximation algorithms for interesting NPhard problems. Today we consider MAXCUT, which we proved to
More informationMath 443/543 Graph Theory Notes 4: Connector Problems
Math 443/543 Graph Theory Notes 4: Connector Problems David Glickenstein September 19, 2012 1 Trees and the Minimal Connector Problem Here is the problem: Suppose we have a collection of cities which we
More information1 Digraphs. Definition 1
1 Digraphs Definition 1 Adigraphordirected graphgisatriplecomprisedofavertex set V(G), edge set E(G), and a function assigning each edge an ordered pair of vertices (tail, head); these vertices together
More informationStudent Name and ID Number. MATH 3012 Final Exam, May 3, 2013, WTT
MATH 30 Final Exam, May 3, 03, WTT Student Name and ID Number Note. The questions posed here appeared on the Spring 03 Final Exam, although in some instances, the format of the question has been altered.
More information10. Graph Matrices Incidence Matrix
10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a
More informationPlanar Tree Transformation: Results and Counterexample
Planar Tree Transformation: Results and Counterexample Selim G Akl, Kamrul Islam, and Henk Meijer School of Computing, Queen s University Kingston, Ontario, Canada K7L 3N6 Abstract We consider the problem
More informationFactors and Factorizations of Graphs
Factors and Factorizations of Graphs Jin Akiyama and Mikio Kano June 2007 Version 1.0 A list of some notation G denotes a graph. X Y X is a subset of Y. X Y X is a proper subset of Y. X Y X \ Y, where
More informationOn the crossing number of K m,n
On the crossing number of K m,n Nagi H. Nahas nnahas@acm.org Submitted: Mar 15, 001; Accepted: Aug 10, 00; Published: Aug 1, 00 MR Subject Classifications: 05C10, 05C5 Abstract The best lower bound known
More informationHOLES 5.1. INTRODUCTION
HOLES 5.1. INTRODUCTION One of the major open problems in the field of art gallery theorems is to establish a theorem for polygons with holes. A polygon with holes is a polygon P enclosing several other
More informationAnswer: (a) Since we cannot repeat men on the committee, and the order we select them in does not matter, ( )
1. (Chapter 1 supplementary, problem 7): There are 12 men at a dance. (a) In how many ways can eight of them be selected to form a cleanup crew? (b) How many ways are there to pair off eight women at the
More informationOutline 2.1 Graph Isomorphism 2.2 Automorphisms and Symmetry 2.3 Subgraphs, part 1
GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Abstract. Chapter focuses on the question of when two graphs are to be regarded as the same, on symmetries, and on subgraphs.. discusses the concept
More informationGraph Theory Problems and Solutions
raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is
More informationEvery tree contains a large induced subgraph with all degrees odd
Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University
More informationDivideandConquer. Three main steps : 1. divide; 2. conquer; 3. merge.
DivideandConquer Three main steps : 1. divide; 2. conquer; 3. merge. 1 Let I denote the (sub)problem instance and S be its solution. The divideandconquer strategy can be described as follows. Procedure
More informationLong questions answer Advanced Mathematics for Computer Application If P= , find BT. 19. If B = 1 0, find 2B and 3B.
Unit1: Matrix Algebra Short questions answer 1. What is Matrix? 2. Define the following terms : a) Elements matrix b) Row matrix c) Column matrix d) Diagonal matrix e) Scalar matrix f) Unit matrix OR
More informationColor fixation, color identity and the Four Color Theorem
Color fixation, color identity and the Four Color Theorem Asbjørn Brændeland I argue that there is no 4chromatic planar graph with a joinable pair of color identical vertices, i.e., given a 4chromatic
More informationThe edge slide graph of the ndimensional cube
The edge slide graph of the ndimensional cube Howida AL Fran Institute of Fundamental Sciences Massey University, Manawatu 8th Australia New Zealand Mathematics Convention December 2014 Howida AL Fran
More informationThe 4ordered Hamiltonicity. in planar graphs
The 4ordered Hamiltonicity and the spanning linkedness in planar graphs Kenta Ozeki (National Institute of Informatics, Japan) (JST, ERATO, Kawarabayashi Large Graph Project) kordered (Hamiltonian) G:graph
More informationLecture notes from Foundations of Markov chain Monte Carlo methods University of Chicago, Spring 2002 Lecture 1, March 29, 2002
Lecture notes from Foundations of Markov chain Monte Carlo methods University of Chicago, Spring 2002 Lecture 1, March 29, 2002 Eric Vigoda Scribe: Varsha Dani & Tom Hayes 1.1 Introduction The aim of this
More informationForests and Trees: A forest is a graph with no cycles, a tree is a connected forest.
2 Trees What is a tree? Forests and Trees: A forest is a graph with no cycles, a tree is a connected forest. Theorem 2.1 If G is a forest, then comp(g) = V (G) E(G). Proof: We proceed by induction on E(G).
More informationSection 6.4 Closures of Relations
Section 6.4 Closures of Relations Definition: The closure of a relation R with respect to property P is the relation obtained by adding the minimum number of ordered pairs to R to obtain property P. In
More informationFinding and counting given length cycles
Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected
More informationThe origins of graph theory are humble, even frivolous. Biggs, E. K. Lloyd, and R. J. Wilson)
Chapter 11 Graph Theory The origins of graph theory are humble, even frivolous. Biggs, E. K. Lloyd, and R. J. Wilson) (N. Let us start with a formal definition of what is a graph. Definition 72. A graph
More informationExamination paper for MA0301 Elementær diskret matematikk
Department of Mathematical Sciences Examination paper for MA0301 Elementær diskret matematikk Academic contact during examination: Iris Marjan Smit a, Sverre Olaf Smalø b Phone: a 9285 0781, b 7359 1750
More informationCounting Spanning Trees
Counting Spanning Trees Bang Ye Wu KunMao Chao Counting Spanning Trees This book provides a comprehensive introduction to the modern study of spanning trees. A spanning tree for a graph G is a subgraph
More informationComputational Geometry
Motivation Motivation Polygons and visibility Visibility in polygons Triangulation Proof of the Art gallery theorem Two points in a simple polygon can see each other if their connecting line segment is
More informationConnectivity and cuts
Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every
More informationMidterm Practice Problems
6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator
More informationDetermining If Two Graphs Are Isomorphic 1
Determining If Two Graphs Are Isomorphic 1 Given two graphs, it is often really hard to tell if they ARE isomorphic, but usually easier to see if they ARE NOT isomorphic. Here is our first idea to help
More information