Planar NonPlanar Graphs非平面的平面图.pptVIP

Planar / Non-Planar Graphs Gabriel Laden CS146 – Spring 2004 Dr. Sin-Min Lee Definitions Planar – graph that can be drawn without edges that intersect within a plane Non-Planar – graph that cannot be drawn without edges that intersect within a plane Do Edges Intersect? Planar graphs can sometimes be drawn as non-planar graphs. It is still a planar graph, because they are isomorphic. Three Houses / Three Utilities Q. Suppose we have three houses and three utilities. Is it possible to connect each utility to each of three houses without any lines crossing? Planar or Non-Planar ? This is also known as K(3,3) bipartite graph Another definition Region – The area bounded by a subset of the vertices and edges of a graph Note: the outside area of a graph also counts as a region. Therefore a tree has one region, a simple cycle has two regions. Examples of Counting Regions Commonly Used Variables Variables used in following mathematical proofs G = an arbitrary graph P = number of vertices Q = number of edges R = number of regions n = number of edges that bound a region N = sum of n for all regions of G First Theorem Let G be a connected planar graph p = vertices, q = edges, r = regions Then p – q + r = 2 Theorem is by Euler Proof can be made by induction Second Theorem Let G be a connected planar graph p = (vertices = 3), q = edges Then q = 3p - 6 Proof is a little more interesting, uses first theorem to help solve… Proof: q = 3p – 6 For each region in graph, n = number of edges to form boundary of its region. Sum of all these n’s in graph = N N = 3r must be true, since all regions need at least 3 edges to form them. N = 2q must be true, since no edge can be used more than twice in forming a region (con’t) Proof: q = 3p – 6 3r = N = 2q Solve p – q + r = 2 for r, then substitute 3(-p +q + 2) = 2q q = 3p – 6 is simplified answer Proof: K(3,3) is Non-Planar Proof by contradiction of theorems Since graph is bipartite, no edge connects two edges within same subset o