Chapter 4. Trees. 4.1 Basics


 Carol Dalton
 1 years ago
 Views:
Transcription
1 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. Perhaps most important is the use of trees in computer science, where they are useful as data structures which support information searches. We had an indication of such applications in our discussion of the phone book problem. Theorem If T is a tree of order N, then T has N 1 edges. Proof. Use induction. The cases N = 1, 2 are trivial. Suppose the result is true for trees with fewer than N vertices, and T has N vertices. Discard one edge to get two smaller trees. Use the hypothesis. Theorem A graph G of order N is a tree if and only if it is connected and contains N 1 edges. Proof. The previous result gives half the result. Suppose G is connected and contains N 1 edges. If it has a cycle we can remove an edge without destroying connectivity. Continue until there are no cycles left. The result is a tree with N vertices, but fewer than N 1 edges, which is impossible. So G had no cycles. Theorem If F is a forest of order N containing K connected components, then F contains N K edges. 37
2 38 CHAPTER 4. TREES Proof. Suppose the components, which are trees, have orders N 1,..., N K and sizes N 1 1,...,N K 1. Then F has size (N 1 1) + + (N K 1) = N K. Theorem A graph G of order N is a tree if and only if it is acyclic and contains N 1 edges. Proof. We ve already established that a tree is acyclic, by definition, and has N 1 edges. Suppose G is acyclic with N 1 edges. Then G is a forest with K = 1 components. Theorem Let T be a tree of order N 2. Then T has at least 2 leaves. Proof. Pick a maximal length path v 1,...,v K. Suppose v 1 (or v K ) is not a leaf. Let v 0 v 2 be adjacent to v 1. If v 0 {v 1,...,v K } then T contains a cycle, which it doesn t, so we can extend the path to v 0, contradicting the distance maximality. Theorem Every pair of distinct vertices in a tree T is connected by a unique path. Proof. Pick two distinct vertices u 1 and u 2. Since T is connected there is path from u 1 to u 2. Suppose there are two different paths, u 1 = v 1, v 2,..., v M = u 2, u 1 = w 1, w 2,...,w N = u 2. Pick j as large as possible so that v i = w i for i j. If j < M, then v j, v j+1, w j+1 are distinct vertices. The walk v j,...,v M, w N 1,...,w j+1 contains a path from v j to w j+1, and so we have a cycle by adding the edge w j+1 v j. But T has no cycles, so the path is unique. Recall that the center of a graph is the set of vertices for which ecc(v) = rad(g). Theorem In any tree T, the center is either a single vertex or a pair of adjacent vertices.
3 4.2. SPANNING TREES 39 Proof. Recursively define a sequence of trees, starting with T 0 = T. Given a nonempty T n, let T n+1 be the tree obtained from T n be removing all leaves and their incident edges. Let T N be the last nonempty tree in the sequence. Using the uniqueness of paths, if T n+1 is nonempty, then the center of T n+1 is the center of T n, since the eccentricity of each vertex in T n+1 is reduced by 1 from its eccentricity in T n. For any tree, a leaf v can be in the center if and only if the distance d(v, w) to the most distant vertex w is 0 or 1, so T N is K 1 or K 2. Theorem Let T be a tree with K edges. If G is a graph whose minimum degree is δ(g) K, then G contains T as a subgraph. Proof. Again use induction on K. Check the cases K = 0, 1. Suppose the result is true for trees with fewer than K edges. Now let T be a tree with K edges. Let v be a leaf of T and let w be adjacent to v. Consider the tree T 1 which has vertex set V (T) \ {v}, and the edges of T except vw. Then T 1 is a subgraph of G. The vertex w G has degree K, so some vertex u G adjacent to w is not in T 1. Adding the edge uv to T 1 gives T. 4.2 Spanning trees A spanning tree of a graph G is a subgraph T which is a tree containing all vertices of G. A weighted graph is a graph with a positive number assigned to each edge. A minimum weight spanning tree is a spanning tree with the property that the sum of the edge weights is a minimum. Weighted spanning trees arise in problems where one wants to connect a set of vertices at minimal cost. The text mentions the problem of building new rail lines that connect a group of cities. In this case the weights could be the construction cost for a citytocity rail link. Similar problems arise for establishing communications lines, like fiberoptic cable, etc. Theorem Every connected graph contains a spanning tree. Every weighted graph contains a minimum weight spanning tree. Proof. Remove edges from cycles as long a possible. In practice it may be important to have an efficient procedure for finding minimum weight spanning trees. Before discussing Kruskal s algorithm, here a few points glossed over in the text.
4 40 CHAPTER 4. TREES As part of the algorithm we have to be able to recognize when adding an edge to a tree produces a new tree. Lemma Suppose T is a subtree of G, and e is an edge of G with exactly one vertex in V (T). Then adding e to T gives a tree. Proof. Use the previous result that a graph G of order N is a tree if and only if it is connected and contains N 1 edges. Adding e gives a connected graph, with exactly one new vertex and exactly one new edge. Here is a method to find the connected components of a graph. Connected component algorithm: Initially give the vertices of G distinct numbers. Check all vertices to see if a vertex v has a higher number n(v) than an adjacent vertex w. If it does, reduce the number of v to that of w, that is set n(v) := n(w). Count the number of vertices whose numbers have been changed. Repeat until no vertices change numbers. The vertices with the same numbers lie in the same component. Each round of vertex checking reduces the sum of the vertex numbers by one or more, since at least one vertex number drops until the algorithm terminates. The sum of the vertex numbers starts at N(N 1)/2, so the algorithm could take roughly N 2 (N 1)/2 steps, and each step can involve checking (N 1) adjacent vertices, giving a possible cost of N 2 (N 1) 2 /2. Kruskal s algorithm: (i) Find an edge of minimum weight, and mark it. (ii) While possible, find a minimal weight unmarked edge that can be added to the marked edges without producing a (marked) cycle. (For instance, we can add the edge, compute connected components, and check if the number of edges for each component is one less than the number of vertices.) Theorem Starting with a connected weighted graph, Kruskal s algorithm produces a minimal weight spanning tree. Proof. At each stage we can consider adding an edge by tentatively adding it, finding components, and checking the components to make sure they are trees. Thus at each step we have a forest. If at some stage there is a vertex not in our forest, then by Lemma there will be an addable edge. Thus when the algorithm stops all vertices are included. If two forest components
5 4.3. COUNTING TREES 41 have adjacent vertices, then adding the edge between them won t create a cycle, so when the algorithm stops there will be only one component. Consider the edges e 1,...,e n added by the algorithm in order. If the resulting tree T is not a minimal weight tree, let T be a minimal weight spanning tree which contains the set of edges {e 1,...,e k }, and such that k is as big as possible. Since T is a spanning tree, T + e k+1 contains a cycle C, and some edge e of the cycle is not in T. Removing e from T + e k+1 leaves a connected graph with N 1 edges, which is thus a spanning tree, which contains edges e 1,...,e k+1. Since the algorithm chose e k+1 rather than e, we must have w(e k+1 ) w(e ). This means T + e k+1 e is minimal weight, and agrees with T for more edges, a contradiction. 4.3 Counting trees We ll start by counting all the possible trees with a fixed set of N vertices. In this count we pay attention to edge indexing, not isomorphism classes. Looking ahead, we can think of this as counting the distinct spanning trees of the complete graph on N vertices. Theorem (Cayley s Tree Formula) There are N N 2 distinct labeled trees of order N. Proof. Notice that this is the number of all sequences of length N 2 whose terms come from the set {1,...,N}. In fact, following Prüfer, we ll try to establish a onetoone correspondence between the two sets. Assigning a Sequence to a Labeled Tree For N 3 we re given a tree T with vertices 1,...,N. We want to form a sequence a 1,...,a N Let i = 0 and take T 0 = T. 2. Find the leaf v on T i with the smallest label. 3. Find the label n(w) of the vertex w adjacent to v Let a i+1 = n(w). 4. Remove v from T i to create the tree T i If T i+1 = K 2, stop. Otherwise increment i and go to step 2. This finishes step 1 of the proof, which constructs a function from trees to sequences of length n 2. Let s check that distinct trees result in different sequences. Use induction on the number of vertices in the tree. The first case is N = 3. In this case
6 42 CHAPTER 4. TREES exactly one vertex has degree 2, and the sequences are length 1, giving the number of the vertex of degree 2. Suppose the result is true for distinct trees on the same vertex set of size less than N, and let S and T be two distinct trees on a set of N vertices. Suppose the minimum label of a leaf is i for S and j for T. If i = j there are two cases. If the adjacent vertex labels are different, then the sequences are different in the first position, and we re done. If the adjacent vertex labels are the same, remove the vertices v j and incident edge. The remaining trees are distinct trees on the same N 1 vertices, so have different sequences by the induction hypothesis. Now consider the case i j, and suppose i < j. As the tree shrinks in the algorithm, each vertex is or becomes a leaf. Since v i is not a leaf of T, there is a last stage before it becomes a leaf, and at that stage v i will be adjacent to a leaf. Thus i will appear in the sequence. But as a leaf of S, i will never appear in the S sequence, so the sequences are different. Assigning a Labeled Tree to a Sequence We re given a a sequence σ = a 1,...,a K with terms from 1,..., K Let S = {1,..., K + 2}. 2. Initialize i = 0, σ 0 = σ, S 0 = S. 3. Let j be the smallest number in S i that does not appear in σ i. 4. Add the edge e j joining j and the first entry of σ i. 5. Remove the first entry of σ i to get σ i+1. Remove j from S i to get S i If σ i+1 is empty, add an edge between the two elements of S i+1 and stop. Otherwise, increment i by 1 and return to step 3. We have to check that the graph we produced is a tree. This is done by induction on the number N = K + 2. If N = 2 there is only one edge, so the result is true. Suppose the result is true for orders less than N. The first vertex j 1 selected from S is not in σ. By the induction hypothesis the graph produced using S \ j 1 and σ 1 is a tree, and adding the first edge does not create a cycle since j 1 is excluded from the tree vertices. Now we need to show that distinct sequences produce different trees. Again argue by induction on the number of vertices N = K + 2. In the first case the sequence has length 1, N = 3, and S = {1, 2, 3}. In each case the one term sequence k produces a 3vertex tree with degree two vertex k, and these are distinct. Suppose that distinct sequences produce different trees for fewer than N vertices. Let σ = a 1,...a K and τ = b 1,...,b K be distinct sequences. Let j σ
7 4.3. COUNTING TREES 43 be the first jvalue selected by the algorithm if the sequence σ is used, and j τ be the first jvalue in the τ case. If j σ = j τ and a 1 = b 1, the induction hypothesis insures that we get different trees from the reduced sequences σ 1 and τ 1, and these remain different when the leaves j σ = j τ and edges j σ a 1 = j τ b 1 are added. If j σ = j τ and a 1 b 1, then one tree has a leaf j σ adjacent to a 1, while the other tree has j σ = j τ adjacent to b 1, so these trees are different. If j σ j τ, it suffices to consider j σ < j τ. Since j σ is not available in the τ sequence case, it must be that j σ is in the τ sequence. Every time j σ appears at the front of τ i, an incident edge is added. After the last occurence of j σ in the τ sequence, another edge is added to j σ as an element of S. Thus the degree of j σ in the tree described by the τ sequence is one more than the number of times it appears in the τ sequence. In particular it is not a leaf, as it was in the tree determined by the σ sequence. Here is a more general, if less explicit, way to count spanning trees. The result (due to Kirchhoff 1847) is called the Matrix Tree Theorem. Recall the adjacency matrix A and the degree matrix D. Also recall from Linear Algebra that the i, j cofactor of an n n matrix B is ( 1) i+j det(b(i j), where B(i j) is the (n 1) (n 1) matrix obtained from B by deleting row i and column j. Theorem (Matrix Tree Theorem) If G is a connected labeled graph with adjacency matrix A and degree matrix D, then the number of spanning trees of G is equal to the value of any cofactor of D A.
GRAPH 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 informationTheorem A graph T is a tree if, and only if, every two distinct vertices of T are joined by a unique path.
Chapter 3 Trees Section 3. Fundamental Properties of Trees Suppose your city is planning to construct a rapid rail system. They want to construct the most economical system possible that will meet the
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 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 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 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 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 informationGRAPH THEORY LECTURE 4: TREES
GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection
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 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 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 informationCounting spanning trees
Counting spanning trees Question Given a graph G, howmanyspanningtreesdoesg have? (G) =numberofdistinctspanningtreesofg Definition If G =(V,E) isamultigraphwithe 2 E, theng e (said G contract e ) is the
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 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 information6.042/18.062J Mathematics for Computer Science October 3, 2006 Tom Leighton and Ronitt Rubinfeld. Graph Theory III
6.04/8.06J Mathematics for Computer Science October 3, 006 Tom Leighton and Ronitt Rubinfeld Lecture Notes Graph Theory III Draft: please check back in a couple of days for a modified version of these
More informationGraph Theory Notes. Vadim Lozin. Institute of Mathematics University of Warwick
Graph Theory Notes Vadim Lozin Institute of Mathematics University of Warwick 1 Introduction A graph G = (V, E) consists of two sets V and E. The elements of V are called the vertices and the elements
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 informationDivisor graphs have arbitrary order and size
Divisor graphs have arbitrary order and size arxiv:math/0606483v1 [math.co] 20 Jun 2006 Le Anh Vinh School of Mathematics University of New South Wales Sydney 2052 Australia Abstract A divisor graph G
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 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 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 informationMath 4707: Introduction to Combinatorics and Graph Theory
Math 4707: Introduction to Combinatorics and Graph Theory Lecture Addendum, November 3rd and 8th, 200 Counting Closed Walks and Spanning Trees in Graphs via Linear Algebra and Matrices Adjacency Matrices
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 informationCOT5405 Analysis of Algorithms Homework 3 Solutions
COT0 Analysis of Algorithms Homework 3 Solutions. Prove or give a counter example: (a) In the textbook, we have two routines for graph traversal  DFS(G) and BFS(G,s)  where G is a graph and s is any
More informationChapter 2 Paths and Searching
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
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 informationPlanar Graph and Trees
Dr. Nahid Sultana December 16, 2012 Tree Spanning Trees Minimum Spanning Trees Maps and Regions Eulers Formula Nonplanar graph Dual Maps and the Four Color Theorem Tree Spanning Trees Minimum Spanning
More informationInduction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition
Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing
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 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 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 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 informationPartitioning edgecoloured complete graphs into monochromatic cycles and paths
arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edgecoloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political
More informationNotes on Matrix Multiplication and the Transitive Closure
ICS 6D Due: Wednesday, February 25, 2015 Instructor: Sandy Irani Notes on Matrix Multiplication and the Transitive Closure An n m matrix over a set S is an array of elements from S with n rows and m columns.
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 informationFull and Complete Binary Trees
Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full
More informationPlanarity 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 informationA tree can be defined in a variety of ways as is shown in the following theorem: 2. There exists a unique path between every two vertices of G.
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
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 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 informationLecture 7: Approximation via Randomized Rounding
Lecture 7: Approximation via Randomized Rounding Often LPs return a fractional solution where the solution x, which is supposed to be in {0, } n, is in [0, ] n instead. There is a generic way of obtaining
More informationGraph Theory for Articulated Bodies
Graph Theory for Articulated Bodies Alba PerezGracia Department of Mechanical Engineering, Idaho State University Articulated Bodies A set of rigid bodies (links) joined by joints that allow relative
More informationA CHARACTERIZATION OF TREE TYPE
A CHARACTERIZATION OF TREE TYPE LON H MITCHELL Abstract Let L(G) be the Laplacian matrix of a simple graph G The characteristic valuation associated with the algebraic connectivity a(g) is used in classifying
More informationMean RamseyTurán numbers
Mean RamseyTurá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
More informationHandout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs
MCS236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set
More informationLesson 3. Algebraic graph theory. Sergio Barbarossa. Rome  February 2010
Lesson 3 Algebraic graph theory Sergio Barbarossa Basic notions Definition: A directed graph (or digraph) composed by a set of vertices and a set of edges We adopt the convention that the information flows
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 informationLecture 1: Course overview, circuits, and formulas
Lecture 1: Course overview, circuits, and formulas Topics in Complexity Theory and Pseudorandomness (Spring 2013) Rutgers University Swastik Kopparty Scribes: John Kim, Ben Lund 1 Course Information Swastik
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 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 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 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 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 informationCharacterizations of Arboricity of Graphs
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
More informationA. V. Gerbessiotis CS Spring 2014 PS 3 Mar 24, 2014 No points
A. V. Gerbessiotis CS 610102 Spring 2014 PS 3 Mar 24, 2014 No points Problem 1. Suppose that we insert n keys into a hash table of size m using open addressing and uniform hashing. Let p(n, m) be the
More informationLattice Point Geometry: Pick s Theorem and Minkowski s Theorem. Senior Exercise in Mathematics. Jennifer Garbett Kenyon College
Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem Senior Exercise in Mathematics Jennifer Garbett Kenyon College November 18, 010 Contents 1 Introduction 1 Primitive Lattice Triangles 5.1
More information3.6 DAGs and Topological Ordering. v 1 v 2 v 3 v 4 v 5 v 6 v 7
3.6 DAGs and Topological Ordering v 1 v 2 v 3 v 4 v 5 v 6 v 7 Directed Acyclic Graphs Def. A DAG is a directed graph that contains no directed cycles. Ex. Precedence constraints: edge (v i, v j ) means
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
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 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 informationLecture 7. The MatrixTree Theorem. 7.1 Kircho s MatrixTree Theorem
Lecture The MatrixTree Theorem This section of the notes introduces a very beautiful theorem that uses linear algebra to count trees in graphs. Reading: The next few lectures are not covered in Jungnickel
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 informationSample Problems in Discrete Mathematics
Sample Problems in Discrete Mathematics This handout lists some sample problems that you should be able to solve as a prerequisite to Computer Algorithms Try to solve all of them You should also read
More informationMathematical Induction
MCS236: Graph Theory Handout #A5 San Skulrattanakulchai Gustavus Adolphus College Sep 15, 2010 Mathematical Induction The following three principles governing N are equivalent. Ordinary Induction Principle.
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 informationA counterexample to a result on the tree graph of a graph
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
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 informationOn Total Domination in Graphs
University of Houston  Downtown Senior Project  Fall 2012 On Total Domination in Graphs Author: David Amos Advisor: Dr. Ermelinda DeLaViña Senior Project Committee: Dr. Sergiy Koshkin Dr. Ryan Pepper
More informationLecture Notes on Spanning Trees
Lecture Notes on Spanning Trees 15122: Principles of Imperative Computation Frank Pfenning Lecture 26 April 26, 2011 1 Introduction In this lecture we introduce graphs. Graphs provide a uniform model
More informationLecture 6: Approximation via LP Rounding
Lecture 6: Approximation via LP Rounding Let G = (V, E) be an (undirected) graph. A subset C V is called a vertex cover for G if for every edge (v i, v j ) E we have v i C or v j C (or both). In other
More informationNetwork (Tree) Topology Inference Based on Prüfer Sequence
Network (Tree) Topology Inference Based on Prüfer Sequence C. Vanniarajan and Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai 600036 vanniarajanc@hcl.in,
More informationDiscrete Mathematics, Chapter 5: Induction and Recursion
Discrete Mathematics, Chapter 5: Induction and Recursion Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 5 1 / 20 Outline 1 Wellfounded
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 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 informationComputer Science Department. Technion  IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2connected graph G and any vertex s G there
 1  THREE TREEPATHS Avram Zehavi Alon Itai Computer Science Department Technion  IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2connected graph G and any vertex s G there
More informationApproximation Algorithms
Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NPCompleteness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms
More informationWeek 5 Integral Polyhedra
Week 5 Integral Polyhedra We have seen some examples 1 of linear programming formulation that are integral, meaning that every basic feasible solution is an integral vector. This week we develop a theory
More informationLabeling outerplanar graphs with maximum degree three
Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics
More information14. Trees and Their Properties
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.
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 informationThe treenumber and determinant expansions (Biggs 67)
The treenumber and determinant expansions (Biggs 67) André Schumacher March 20, 2006 Overview Biggs 67 [1] The treenumber κ(γ) κ(γ) and the Laplacian matrix The σ function Elementary (sub)graphs Coefficients
More informationOn Integer Additive SetIndexers of Graphs
On Integer Additive SetIndexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A setindexer of a graph G is an injective setvalued function f : V (G) 2 X such that
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
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 informationExponential time algorithms for graph coloring
Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A klabeling of vertices of a graph G(V, E) is a function V [k].
More informationSolutions to Homework 6
Solutions to Homework 6 Debasish Das EECS Department, Northwestern University ddas@northwestern.edu 1 Problem 5.24 We want to find light spanning trees with certain special properties. Given is one example
More informationThe Geometric Structure of Spanning Trees and Applications to Multiobjective Optimization
The Geometric Structure of Spanning Trees and Applications to Multiobjective Optimization By ALLISON KELLY O HAIR SENIOR THESIS Submitted in partial satisfaction of the requirements for Highest Honors
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 informationConnections between decomposition trees of 3connected plane triangulations and hamiltonian properties
Introduction Hamiltonicity Other hamiltonian properties Connections between decomposition trees of 3connected plane triangulations and hamiltonian properties Gunnar Brinkmann Jasper Souffriau Nico Van
More informationUnicyclic Graphs with Given Number of Cut Vertices and the Maximal Merrifield  Simmons Index
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
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 informationTrees. Definition: A tree is a connected undirected graph with no simple circuits. Example: Which of these graphs are trees?
Section 11.1 Trees Definition: A tree is a connected undirected graph with no simple circuits. Example: Which of these graphs are trees? Solution: G 1 and G 2 are trees both are connected and have no simple
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 informationThe Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.
The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,
More informationDeterminants LECTURE Calculating the Area of a Parallelogram. Definition Let A be a 2 2 matrix. A = The determinant of A is the number
LECTURE 13 Determinants 1. Calculating the Area of a Parallelogram Definition 13.1. Let A be a matrix. [ a c b d ] The determinant of A is the number det A) = ad bc Now consider the parallelogram formed
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 informationAn inequality for the group chromatic number of a graph
An inequality for the group chromatic number of a graph HongJian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics
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 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 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 information