Math 443/543 Graph Theory Notes 4: Connector Problems

Transcription

1 Math 443/543 Graph Theory Notes 4: Connector Problems David Glickenstein September 19, Trees and the Minimal Connector Problem Here is the problem: Suppose we have a collection of cities which we want to connect by a system of railway lines. Also suppose we know the cost of constructing lines between pairs of cities. How do we construct the system so that the cost is minimal, regardless of the inconvenience to the passengers. De nition 1 A network (or weighted graph) is a graph G together with a map : E! R. The function may represent the length of an edge, or conductivity, or cross-sectional area or many other things. Given a network (G; ) ; we can de ne the weight of a subgraph H G to be (H) = X (e) : e2e(h) The problem is then: given two vertices u 0 ; v 0 2 V (G) ; nd a u 0 v 0 -path of smallest weight (where we consider the path as a subgraph). NOTE: We will assume that (e) > 0 for the remainder of the section, as this simpli es exposition. We are trying to construct a network of minimal cost. Here are some observations: The solution must be connected. The solution should contain no cycles, for if there were any cycles, we could remove one of the edges to get a smaller cost, and passengers could still get from one place to the other. Thus we want every edge to be a bridge. Such a graph is called a tree. De nition 2 A graph with no cycles is called a forest. A connected graph with no cycles is called a tree. 1

2 Note that each component of a forest is a tree. Trees kind of look like branches of a tree, which is where the name comes from. Here are some properties of trees. Theorem 3 Let u and v be two vertices of a tree G: Then there is exactly one uv-path in G: Proof. Since G is connected, there is at least one uv-path. Suppose there were two uv-paths, P = v 0 ; v 1 ; v 2 ; : : : ; v k and P 0 = v0; 0 v1; 0 v2; 0 : : : ; vk 0 0 (note that k need not equal k 0 ). If P 6= P 0 ; then we can de ne s and f as s = min i : v i+1 6= v 0 i+1 f = max i : v i 1 6= v 0 i 1 : We can then construct two disjoint paths between v s and v f ; producing a cycle. But there are no cycles in G; so we must have P = P 0 : Also, recall the following: Theorem 4 If a (p; q)-graph G is a tree, then q = p 1: We come back to the minimal connector problem. De nition 5 If G is a connected graph, a subgraph T which is a tree and contains every vertex of G is called a spanning tree. We wish to nd a spanning tree of minimal value. Let s nd a particular tree called an economy tree. We construct the subgraph T E starting with all of the vertices of G and then add edges one at a time: 1. First add the edge of minimal weight. 2. Continue to add edges of minimal weight unless they would form a cycle with the previously added edges. 3. Stop when the graph is connected. Since no cycles are produced and the graph ends up connected and reaching every vertex, we produce a spanning tree. One might ask whether we can, in fact do this; that is, is it possible that no edges can be added that would not result in a cycle, yet the graph is not connected. If the subgraph T E at some stage is not connected, then consider a path between two di erent components (which exists since G was connected). If all edges on the path not already in T E (there must be some) create a cycle when added, then the two components were already connected (by the other part of the cycle), a contradiction. Note that the economy tree is not necessarily unique. We may have many of them. The theorem is that the economy tree solves the minimal connector problem. 2

3 Theorem 6 Let (G; ) be a network. The economy tree T E has minimal weight among all spanning trees. Proof. Let T 0 be a spanning tree of minimal weight. We will show that (T E ) (T 0 ) ; which implies equality since (T 0 ) is minimal among all spanning trees. We can order the edges in T E by the weights, i.e., E (T E ) = fe 1 ; e 2 ; : : : ; e p 1 g where (e i ) (e i+1 ) : Now let e j be the rst edge in T E which is not in T 0 : Let G 0 = T 0 + e j : Since T 0 is a spanning tree, G 0 must have a cycle C: Since T E is a tree, there must be an edge e 0 in C which is not in T E : In particular, e 0 2 T 0 : We can consider the graph T0 0 = G 0 e 0 ; which has no cycles and is connected, so it is also a spanning tree. We notice that Since T 0 is minimal, we have and hence (T 0 0) = (T 0 ) + (e j ) (e 0 ) : (T 0 ) (T 0 0) = (T 0 ) + (e j ) (e 0 ) (e 0 ) (e j ) : However, (e j ) was chosen to have minimal weight among edges in G not in T E in the construction, which means we must have that Thus (e 0 ) = (e j ) : (T 0 0) = (T 0 ) : So T0 0 is also minimal. We now consider T0 0 instead of T 0 : We may do the same construction as before, nding the rst edge e j 0 which is in T E but not T0: 0 We note that j 0 j + 1: We may continue to do this until we construct a minimal spanning tree which is equal to T E : See Example in Figure 4.11 in C. Note, the algorithm of constructing the economy tree is called Kruskal s algorithm. BM-8.5 Note that Kruskal s algorithm can give a minimal spanning forest as well. 2 Shortest path problems and Dijkstra s algorithm We consider the shortest path problem: Given a railway network connecting various towns, determine the shortest route between a given pair of towns. Often, we will refer to the the weight of an edge as a length and the value of the smallest weight as the distance. We will present the algorithm of Dijkstra and Whiting-Hillier (found independently). In the sequel, we will assume that is de ned on all pairs of vertices and (uv) = 1 if uv =2 E (G) : 3

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:

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.

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

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.

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.

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

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

arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edge-coloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political

14. Trees and Their Properties This is the first of a few articles in which we shall study a special and important family of graphs, called trees, discuss their properties and introduce some of their applications.

Chapter 2 Paths and Searching Section 2.1 Distance Almost every day you face a problem: You must leave your home and go to school. If you are like me, you are usually a little late, so you want to take

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

7 Basic Properties 24 TREES 7 Basic Properties Definition 7.1: A connected graph G is called a tree if the removal of any of its edges makes G disconnected. A tree can be defined in a variety of ways as

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

Filomat 28:3 (2014), 451 461 DOI 10.2298/FIL1403451H Published by Faculty of Sciences Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Unicyclic Graphs with Given Number

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

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?

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

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

Characterizations of Arboricity of Graphs Ruth Haas Smith College Northampton, MA USA Abstract The aim of this paper is to give several characterizations for the following two classes of graphs: (i) graphs

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.

CHAPTER 3 SEMITOTAL AND TOTAL BLOCK-CUTVERTEX GRAPH ABSTRACT This chapter begins with the notion of block distances in graphs. Using block distance we defined the central tendencies of a block, like B-radius

AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 63(3) (2015), Pages 368 373 A counterexample to a result on the tree graph of a graph Ana Paulina Figueroa Departamento de Matemáticas Instituto Tecnológico

CHAPTER 7 Introduction to Relations 1. Relations and Their Properties 1.1. Definition of a Relation. Definition: A binary relation from a set A to a set B is a subset R A B. If (a, b) R we say a is related

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

1 Trees A graph is called a tree, if it is connected and has no cycles. A star is a tree with one vertex adjacent to all other vertices. Theorem 1 For every simple graph G with n 1 vertices, the following

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

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

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

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

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

Math 421, Homework #5 Solutions (1) (8.3.6) Suppose that E R n and C is a subset of E. (a) Prove that if E is closed, then C is relatively closed in E if and only if C is a closed set (as defined in Definition

How to make a soccer ball Euler s relation for polyhedra and planar graphs Bogdan Enescu 1 Introduction The Germany national soccer team reached the World Cup nal in 1982 but they were defeated by Italy

Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that a = bq + r and 0 r < b. We re dividing a by b: q is the quotient and r is the remainder,

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

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

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

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

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).

Color fixation, color identity and the Four Color Theorem Asbjørn Brændeland I argue that there is no 4-chromatic planar graph with a joinable pair of color identical vertices, i.e., given a 4-chromatic

Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor

On the Union of Arithmetic Progressions Shoni Gilboa Rom Pinchasi August, 04 Abstract We show that for any integer n and real ɛ > 0, the union of n arithmetic progressions with pairwise distinct differences,

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A long-standing