DOCSLIB.ORG

The Complexity of Greedoid Tutte Polynomials

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Complexity of Greedoid Tutte Polynomials THE COMPLEXITY OF GREEDOID TUTTE POLYNOMIALS A thesis submitted for the degree of Doctor of Philosophy by Christopher N. Knapp Department of Mathematics, Brunel University London ABSTRACT We consider the computational complexity of evaluating the Tutte polynomial of three particular classes of greedoid, namely rooted graphs, rooted digraphs and binary greedoids. Furthermore we construct polynomial-time algorithms to evaluate the Tutte polynomial of these classes of greedoid when they’re of bounded tree-width. We also construct a M¨obius function formulation for the char- acteristic polynomial of a rooted graph and determine the computational complexity of computing the coefficients of the Tutte polynomial of a rooted graph. 1 ACKNOWLEDGEMENTS I would like to express my most sincere gratitude to my supervisor, Steve Noble. This thesis is a reflection of his expertise, innovation and progressive ideas. Not only this, but it also reflects the many hours he spent tirelessly guiding me with the upmost patience. His charisma and sense of humour both contributed to making our meetings so engaging, and I will be forever indebted to him for having confidence in me even when I didn’t have it in myself. I would also like to thank my second supervisor, Rhiannon Hall, for her much-needed support and constructive criticism, and the administrative staff in the department, in particular Frances Foster and Linda Campbell, for going above and beyond to answer all of my daily queries. I dedicate this thesis to my two biggest supporters - my mum and my nana, both of whom I sadly lost in 2016. 2 Contents Abstract 1 Acknowledgements 2 1 Introduction 5 1.1 Introduction...................................... ... 5 1.2 GraphsandMatroids................................. ... 6 1.3 RootedGraphs,RootedDigraphsandGreedoids . ........ 10 1.4 Complexity ......................................... 27 1.5 TheTuttePolynomialofaGraph. .... 30 1.6 The Complexity of Computing the Tutte Polynomial of a Graph . ....... 32 1.7 The Tutte Polynomial of an Arbitrary Greedoid, a Rooted Graph and a Rooted Digraph 33 2 The Computational Complexity of Evaluating the Tutte Polynomial at a Fixed Point 39 2.1 Introduction...................................... ... 39 2.2 GreedoidConstructions .............................. .... 40 2.3 RootedGraphs ..................................... .. 47 2.3.1 Introduction .................................... 47 2.3.2 ProofofMainTheorem .............................. 48 2.4 RootedDigraphs .................................... .. 61 2.5 BinaryGreedoids.................................... .. 73 3 Polynomial-Time Algorithms for Evaluating the Tutte Polynomial 77 3.1 Introduction...................................... ... 77 3 3.2 RootedGraphs ..................................... .. 83 3.2.1 Complexity of the Algorithm . 97 3.3 RootedDigraphs .................................... 100 3.3.1 Complexity of the Algorithm . 109 3.4 BinaryGreedoids.................................... 110 4 The Characteristic Polynomial and the Computational Complexity of the Coef- ficientsoftheTuttePolynomialofaRootedGraph 117 4.1 The Characteristic Polynomial . .... 117 4.2 TheCoefficients..................................... 128 4.2.1 Coefficients of T (G; x, 0).............................. 135 4.3 A Convolution Formula for the Tutte Polynomial of an Interval Greedoid . 139 4 Chapter 1 Introduction 1.1 Introduction This thesis comprises four chapters. Chapter 1 contains the foundations for the thesis. Two combina- torial structures, namely matroids and their generalization greedoids, are discussed and relationships between particular classes of them are explored. We discuss the fundamental ideas of computational complexity theory and delve into the wide range of results surrounding the renowned Tutte polyno- mial. Evaluating the Tutte polynomial of a graph at most fixed rational points is shown to be #P- hard in [31]. The k-thickening operation plays a significant role in the proof of this result. We begin Chapter 2 by generalizing the k-thickening operation to greedoids. We introduce two more greedoid constructions and give expressions for the Tutte polynomials resulting from these constructions. We then use these to find analogous results to those in [31] by completely determining the computational complexity of evaluating the Tutte polynomial of a rooted graph, a rooted digraph and of a binary greedoid at a fixed rational point. For the rooted graph case we also strengthen our results by restricting the problem to cubic, planar, bipartite rooted graphs. Many computational problems that are intractable for arbitrary graphs become easy for the class of graphs of bounded tree-width. In [42] Noble illustrates this result by constructing a polynomial- time algorithm to evaluate the Tutte polynomial of a graph of bounded tree-width. In Chapter 3 we construct polynomial-time algorithms to evaluate the Tutte polynomials of the classes considered in the previous chapter when each is of bounded tree-width. 5 The characteristic polynomial of a matroid is a specialization of the Tutte polynomial. In [64] Zaslavsky gives an expression for the characteristic polynomial of a matroid in terms of the M¨obius function. Gordon and McMahon generalize the characteristic polynomial to greedoids in [22] and show that several of the matroidal results have direct greedoid analogues. In Chapter 4 we begin by constructing a M¨obius function formulation for the characteristic polynomial of a rooted graph. In [2] Annan determines the computational complexity of computing the coefficients of the Tutte polynomial of a graph. He shows that for fixed non-negative integers i and j, computing the coefficient of xiyj in the Tutte polynomial of a graph is #P-hard. We continue Chapter 4 by finding analogous results for the coefficients of the Tutte polynomial of a rooted graph. We then study the smallest integer i such that the coefficient of xi in the Tutte polynomial expansion of a rooted graph is non-zero. In [34] Kook et al present a convolution formula for the Tutte polynomial of a matroid. A natural question would be to ask if we could extend this convolution formula to greedoids. We conclude Chapter 4 by conjecturing that if the conditions hold in the proof of this convolution formula for an interval greedoid then that interval greedoid is a matroid. 1.2 Graphs and Matroids We assume familiarity with the basic ideas of graph theory. For a more in-depth introduction to graphs, the reader is referred to [14] or [24], for example, from where the following definitions and basic results are taken. A graph G is a pair of sets (V (G), E(G)) where the elements of V (G) and E(G) are vertices and edges of G respectively. We can omit the argument when there is no fear of ambiguity. For the following graph definitions assume G = (V, E) and let A E and S V . Two vertices of a graph ⊆ ⊆ are adjacent if there exists an edge between them. Similarly two edges are adjacent if they share a common endpoint. An edge is incident to a vertex if the vertex is an endpoint of the edge. A set of edges are in parallel if they all share the same endpoints. The parallel class of an edge e E is the ∈ maximal set of edges that are in parallel with e in G, including e itself. The multiplicity of e is the cardinality of its parallel class, denoted by m(e). A set of pairwise non-adjacent vertices is said to be independent. A subgraph of G is a graph G′ = (V ′, E′) with V ′ V and E′ E. A subgraph G′ ⊆ ⊆ of G is spanning if V (G′)= V (G). The graph obtained by restricting the edges to those in A is given by G A = (V, A). The graphs | 6 obtained by deleting the sets A and S are given by G A = (V, E A) and G S = (V S, E E′) \ − \ − − respectively such that E′ is the set of edges incident to any vertex in S. If e is an edge of a graph G, then the graph G/e, the contraction of e from G, is obtained by removing e and identifying its endpoints into a single new vertex. If e and f are edges of G, then G/e/f = G/f/e, so the definition of contraction may be generalized to sets of edges without any ambiguity. Moreover, G/e f = G f/e, so we define a minor of G to be any graph obtained from G by deleting and \ \ contracting edges. The order of the deletions and contractions does not matter. We say G is connected if there is a path between any two vertices in G. A component of a graph is a maximal connected subgraph. We denote the number of components of G A by κ (A) and let | G κ(G)= κ (E(G)). The rank of A, denoted by r (A), is given by r (A)= V (G) κ (A). We let G G G | |− G r(G)= rG(E(G)). We can omit the subscripts in κG(A) and rG(A) when the context is clear. A graph is planar if it can be embedded in the plane without any of its edges crossing, and it is a plane graph if it is embedded in the plane in such a way. Every plane connected graph G has a dual graph G∗ formed by assigning a vertex of G∗ to each face of G, and j edges between vertices in G∗ whenever the corresponding faces of G share j edges in their boundaries. For a plane non- connected graph G we define the dual G∗ to be the union of the duals of each connected component. Clearly duality is an involution, that is (G∗)∗ = G for all G. If G is plane and A E(G) we have ⊆ r ∗ (A)= A r(G)+ r (E A). A more generalized variation of this result is proven in [62]. G | |− G − A loop of a graph is an edge whose endpoints are the same vertex, and a coloop, otherwise known as a bridge or an isthmus, is an edge whose deletion would increase the number of components. Thus a coloop is an edge that is not contained in any cycle.
Load more

Recommended publications
  • Descriptive Graph Combinatorics
    Descriptive Graph Combinatorics Alexander S. Kechris and Andrew S. Marks (Preliminary version; November 3, 2018) Introduction In this article we survey the emerging field of descriptive graph combina- torics. This area has developed in the last two decades or so at the interface of descriptive set theory and graph theory, and it has interesting connections with other areas such as ergodic theory and probability theory. Our object of study is the theory of definable graphs, usually Borel or an- alytic graphs on Polish spaces. We investigate how combinatorial concepts, such as colorings and matchings, behave under definability constraints, i.e., when they are required to be definable or perhaps well-behaved in the topo- logical or measure theoretic sense. To illustrate the new phenomena that can arise in the definable context, consider for example colorings of graphs. As usual a Y -coloring of a graph G = (X; G), where X is the set of vertices and G ⊆ X2 the edge relation, is a map c: X ! Y such that xGy =) c(x) 6= c(y). An elementary result in graph theory asserts that any acyclic graph admits a 2-coloring (i.e., a coloring as above with jY j = 2). On the other hand, consider a Borel graph G = (X; G), where X is a Polish space and G is Borel (in X2). A Borel coloring of G is a coloring c: X ! Y as above with Y a Polish space and c a Borel map. In contrast to the above basic fact, there are acyclic Borel graphs G which admit no Borel countable coloring (i.e., with jY j ≤ @0); see Example 3.14.
    [Show full text]
  • A Combinatorial Abstraction of the Shortest Path Problem and Its Relationship to Greedoids
    A Combinatorial Abstraction of the Shortest Path Problem and its Relationship to Greedoids by E. Andrew Boyd Technical Report 88-7, May 1988 Abstract A natural generalization of the shortest path problem to arbitrary set systems is presented that captures a number of interesting problems, in­ cluding the usual graph-theoretic shortest path problem and the problem of finding a minimum weight set on a matroid. Necessary and sufficient conditions for the solution of this problem by the greedy algorithm are then investigated. In particular, it is noted that it is necessary but not sufficient for the underlying combinatorial structure to be a greedoid, and three ex­ tremely diverse collections of sufficient conditions taken from the greedoid literature are presented. 0.1 Introduction Two fundamental problems in the theory of combinatorial optimization are the shortest path problem and the problem of finding a minimum weight set on a matroid. It has long been recognized that both of these problems are solvable by a greedy algorithm - the shortest path problem by Dijk­ stra's algorithm [Dijkstra 1959] and the matroid problem by "the" greedy algorithm [Edmonds 1971]. Because these two problems are so fundamental and have such similar solution procedures it is natural to ask if they have a common generalization. The answer to this question not only provides insight into what structural properties make the greedy algorithm work but expands the class of combinatorial optimization problems known to be effi­ ciently solvable. The present work is related to the broader question of recognizing gen­ eral conditions under which a greedy algorithm can be used to solve a given combinatorial optimization problem.
    [Show full text]
  • Arxiv:1403.0920V3 [Math.CO] 1 Mar 2019
    Matroids, delta-matroids and embedded graphs Carolyn Chuna, Iain Moffattb, Steven D. Noblec,, Ralf Rueckriemend,1 aMathematics Department, United States Naval Academy, Chauvenet Hall, 572C Holloway Road, Annapolis, Maryland 21402-5002, United States of America bDepartment of Mathematics, Royal Holloway University of London, Egham, Surrey, TW20 0EX, United Kingdom cDepartment of Mathematics, Brunel University, Uxbridge, Middlesex, UB8 3PH, United Kingdom d Aschaffenburger Strasse 23, 10779, Berlin Abstract Matroid theory is often thought of as a generalization of graph theory. In this paper we propose an analogous correspondence between embedded graphs and delta-matroids. We show that delta-matroids arise as the natural extension of graphic matroids to the setting of embedded graphs. We show that various basic ribbon graph operations and concepts have delta-matroid analogues, and illus- trate how the connections between embedded graphs and delta-matroids can be exploited. Also, in direct analogy with the fact that the Tutte polynomial is matroidal, we show that several polynomials of embedded graphs from the liter- ature, including the Las Vergnas, Bollab´as-Riordanand Krushkal polynomials, are in fact delta-matroidal. Keywords: matroid, delta-matroid, ribbon graph, quasi-tree, partial dual, topological graph polynomial 2010 MSC: 05B35, 05C10, 05C31, 05C83 1. Overview Matroid theory is often thought of as a generalization of graph theory. Many results in graph theory turn out to be special cases of results in matroid theory. This is beneficial
    [Show full text]
  • Calculating Graph Algorithms for Dominance and Shortest Path*
    Calculating Graph Algorithms for Dominance and Shortest Path⋆ Ilya Sergey1, Jan Midtgaard2, and Dave Clarke1 1 KU Leuven, Belgium {first.last}@cs.kuleuven.be 2 Aarhus University, Denmark [email protected] Abstract. We calculate two iterative, polynomial-time graph algorithms from the literature: a dominance algorithm and an algorithm for the single-source shortest path problem. Both algorithms are calculated di- rectly from the definition of the properties by fixed-point fusion of (1) a least fixed point expressing all finite paths through a directed graph and (2) Galois connections that capture dominance and path length. The approach illustrates that reasoning in the style of fixed-point calculus extends gracefully to the domain of graph algorithms. We thereby bridge common practice from the school of program calculation with common practice from the school of static program analysis, and build a novel view on iterative graph algorithms as instances of abstract interpretation. Keywords: graph algorithms, dominance, shortest path algorithm, fixed-point fusion, fixed-point calculus, Galois connections 1 Introduction Calculating an implementation from a specification is central to two active sub- fields of theoretical computer science, namely the calculational approach to pro- gram development [1,12,13] and the calculational approach to abstract interpre- tation [18, 22, 33, 34]. The advantage of both approaches is clear: the resulting implementations are provably correct by construction. Whereas the former is a general approach to program development, the latter approach is mainly used for developing provably sound static analyses (with notable exceptions [19,25]). Both approaches are anchored in some of the same discrete mathematical structures, namely partial orders, complete lattices, fixed points and Galois connections.
    [Show full text]
  • Matroids You Have Known
    26 MATHEMATICS MAGAZINE Matroids You Have Known DAVID L. NEEL Seattle University Seattle, Washington 98122 [email protected] NANCY ANN NEUDAUER Pacific University Forest Grove, Oregon 97116 nancy@pacificu.edu Anyone who has worked with matroids has come away with the conviction that matroids are one of the richest and most useful ideas of our day. —Gian Carlo Rota [10] Why matroids? Have you noticed hidden connections between seemingly unrelated mathematical ideas? Strange that finding roots of polynomials can tell us important things about how to solve certain ordinary differential equations, or that computing a determinant would have anything to do with finding solutions to a linear system of equations. But this is one of the charming features of mathematics—that disparate objects share similar traits. Properties like independence appear in many contexts. Do you find independence everywhere you look? In 1933, three Harvard Junior Fellows unified this recurring theme in mathematics by defining a new mathematical object that they dubbed matroid [4]. Matroids are everywhere, if only we knew how to look. What led those junior-fellows to matroids? The same thing that will lead us: Ma- troids arise from shared behaviors of vector spaces and graphs. We explore this natural motivation for the matroid through two examples and consider how properties of in- dependence surface. We first consider the two matroids arising from these examples, and later introduce three more that are probably less familiar. Delving deeper, we can find matroids in arrangements of hyperplanes, configurations of points, and geometric lattices, if your tastes run in that direction.
    [Show full text]
  • The Characteristic Polynomial of Multi-Rooted
    THE CHARACTERISTIC POLYNOMIAL OF MULTI-ROOTED, DIRECTED TREES LAUREN EATON Mathematics 8 May 2008 Independent Research Project: Candidate for Departmental Honors Graduation: 17 May 2008 THE CHARACTERISTIC POLYNOMIAL OF MULTI-ROOED, DIRECTED TREES LAUREN EATON Abstract. We define the characteristic polynomial for single-rooted trees and begin with a theorem about this polynomial, derived from the known contrac- tion/deletion formula. We expand our scope to include multi-rooted, directed trees. Introducing the concept of a star, we prove two theorems which allow us to evaluate the polynomials of these trees in terms of the stars that comprise them. Finally, we derive and prove a general formula for the characteristic polynomial of multi-rooted, directed trees. Introduction Introduced by Gary Gordon and Elizabeth McMahon in [3] the greedoid char- acteristic polynomial is a generalization of the Tutte polynomial, which is a two- variable invariant which helps describe the structure of a single-rooted graph. Given a multi-rooted, directed tree, one must conduct an often tedious recursive calcula- tion in order to obtain the polynomial. In this paper, we work towards defining a general formula for the characteristic polynomial that requires minimal calculation and is entirely in terms of the vertices. This paper is organized as follows: In Section 1, we start with a focus on single- rooted trees and an adaptation of the characteristic polynomial. In Section 2, we look at the more complex multi-rooted, directed trees. We will find that when deriving the characteristic polynomial of these complicated trees, one can consider them in simplified terms. We will explore the concept of a sink and see how the polynomial is affected by its presence.
    [Show full text]
  • Branch-Depth: Generalizing Tree-Depth of Graphs
    Branch-depth: Generalizing tree-depth of graphs ∗1 †‡23 34 Matt DeVos , O-joung Kwon , and Sang-il Oum† 1Department of Mathematics, Simon Fraser University, Burnaby, Canada 2Department of Mathematics, Incheon National University, Incheon, Korea 3Discrete Mathematics Group, Institute for Basic Science (IBS), Daejeon, Korea 4Department of Mathematical Sciences, KAIST, Daejeon, Korea [email protected], [email protected], [email protected] November 5, 2020 Abstract We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the no- tions of tree-depth and shrub-depth of graphs as follows. For a graph G = (V, E) and a subset A of E we let λG(A) be the number of vertices incident with an edge in A and an edge in E A. For a subset X of V , \ let ρG(X) be the rank of the adjacency matrix between X and V X over the binary field. We prove that a class of graphs has bounded\ tree-depth if and only if the corresponding class of functions λG has arXiv:1903.11988v2 [math.CO] 4 Nov 2020 bounded branch-depth and similarly a class of graphs has bounded shrub-depth if and only if the corresponding class of functions ρG has bounded branch-depth, which we call the rank-depth of graphs. Furthermore we investigate various potential generalizations of tree- depth to matroids and prove that matroids representable over a fixed finite field having no large circuits are well-quasi-ordered by restriction.
    [Show full text]
  • Rooted Graph Minors and Reducibility of Graph Polynomials Arxiv
    Rooted Graph Minors and Reducibility of Graph Polynomials by Benjamin Richard Moore B.A., Thompson Rivers University, 2015 Dissertation Submitted in Partial Fulfillment of the Requirements for the Degree of Masters of Science in the Department of Mathematics and Statistics Faculty of Science c Benjamin Richard Moore 2017 SIMON FRASER UNIVERSITY Spring 2017 arXiv:1704.04701v1 [math.CO] 15 Apr 2017 All rights reserved. However, in accordance with the Copyright Act of Canada, this work may be reproduced without authorization under the conditions for “Fair Dealing.” Therefore, limited reproduction of this work for the purposes of private study, research, criticism, review and news reporting is likely to be in accordance with the law, particularly if cited appropriately. Approval Name: Benjamin Richard Moore Degree: Masters of Science (Mathematics) Title: Rooted Graph Minors and Reducibility of Graph Poly- nomials Examining Committee: Dr. Ladislav Stacho (chair) Associate Professor Dr. Karen Yeats Senior Supervisor Associate Professor Dr. Luis Goddyn Supervisor Professor Dr. Bojan Mohar Internal Examiner Professor Date Defended: April 6, 2017 ii Abstract In 2009, Brown gave a set of conditions which when satisfied imply that a Feynman integral evaluates to a multiple zeta value. One of these conditions is called reducibility, which loosely says there is an order of integration for the Feynman integral for which Brown’s techniques will succeed. Reducibility can be abstracted away from the Feynman integral to just being a condition on two polynomials, the first and second Symanzik polynomials. The first Symanzik polynomial is defined from the spanning trees of a graph, and the second Symanzik polynomial is defined from both spanning forests of a graph and some edge and vertex weights, called external momenta and masses.
    [Show full text]
  • Large, Lengthy Graphs Look Locally Like Lines
    Large, Lengthy Graphs Look Locally Like Lines Itai Benjamini and Tom Hutchcroft May 9, 2019 Abstract We apply the theory of unimodular random rooted graphs to study the metric geometry of large, finite, bounded degree graphs whose diameter is proportional to their volume. We prove that for a positive proportion of the vertices of such a graph, there exists a mesoscopic scale on which the graph looks like R in the sense that the rescaled ball is close to a line segment in the Gromov-Hausdorff metric. 1 Introduction The aim of this modest note is to prove that large graphs with diameter proportional to their volume must `look like R' from the perspective of a positive proportion of their vertices, after some loc rescaling that may depend on the choice of vertex. We write dGH for the local Gromov-Hausdorff metric, a measure of similarity between locally compact pointed metric spaces that we define in detail in Section 1.1. Theorem 1.1. Let (Gn)n≥1 = ((Vn;En))n≥1 be a sequence of finite, connected graphs with jVnj ! 1, and suppose that there exists a constant C < 1 such that jVnj ≤ C diam(Gn) for every n ≥ 1. Suppose furthermore that the set of degree distributions of the graphs Gn are uniformly integrable. −1 Then there exists a sequence of subsets An ⊆ Vn with lim infn!1 jAnj=jVnj ≥ C such that loc lim sup inf dGH Vn; "dGn ; v ; ; d ; 0 = 0; n!1 ">0 R R v2An arXiv:1905.00316v3 [math.MG] 8 Nov 2020 where we write dGn for the graph metric on Gn and dR(x; y) = jx − yj for the usual metric on R.
    [Show full text]
  • Sparsity Counts in Group-Labeled Graphs and Rigidity
    Sparsity Counts in Group-labeled Graphs and Rigidity Rintaro Ikeshita1 Shin-ichi Tanigawa2 1University of Tokyo 2CWI & Kyoto University July 15, 2015 1 / 23 I Examples I k = ` = 1: forest I k = 1; ` = 0: pseudoforest I k = `: Decomposability into edge-disjoint k forests (Nash-Williams) I ` ≤ k: Decomposability into edge-disjoint k − ` pseudoforests and ` forests I general k; `: Rigidity of graphs and scene analysis (k; `)-sparsity def I A finite undirected graph G = (V ; E) is (k; `)-sparse , jF j ≤ kjV (F )j − ` for every F ⊆ E with kjV (F )j − ` ≥ 1. 2 / 23 (k; `)-sparsity def I A finite undirected graph G = (V ; E) is (k; `)-sparse , jF j ≤ kjV (F )j − ` for every F ⊆ E with kjV (F )j − ` ≥ 1. I Examples I k = ` = 1: forest I k = 1; ` = 0: pseudoforest I k = `: Decomposability into edge-disjoint k forests (Nash-Williams) I ` ≤ k: Decomposability into edge-disjoint k − ` pseudoforests and ` forests I general k; `: Rigidity of graphs and scene analysis 2 / 23 I Examples I k = ` = 1: graphic matroid I k = 1; ` = 0: bicircular matroid I ` ≤ k: union of k − ` copies of bicircular matroid and ` copies of graphic matroid I k = 2; ` = 3: generic 2-rigidity matroid (Laman70) Count Matroids I Suppose ` ≤ 2k − 1. Then Mk;`(G) = (E; Ik;`) forms a matroid, called the (k; `)-count matroid, where Ik;` = fI ⊆ E : I is (k; `)-sparseg: 3 / 23 Count Matroids I Suppose ` ≤ 2k − 1. Then Mk;`(G) = (E; Ik;`) forms a matroid, called the (k; `)-count matroid, where Ik;` = fI ⊆ E : I is (k; `)-sparseg: I Examples I k = ` = 1: graphic matroid I k = 1; ` = 0: bicircular matroid I ` ≤ k: union of k − ` copies of bicircular matroid and ` copies of graphic matroid I k = 2; ` = 3: generic 2-rigidity matroid (Laman70) 3 / 23 Group-labeled Graphs I A group-labeled graph (Γ-labeled graph) (G; ) is a directed finite graph whose edges are labeled invertibly from a group Γ.
    [Show full text]
  • Two Proofs of Cayley's Theorem
    TWO PROOFS OF CAYLEY'S THEOREM TITU ANDREESCU AND COSMIN POHOATA Abstract. We present two proofs of the celebrated Cayley theorem that the number of spanning trees of a complete graph on n vertices is nn−2. In this expository note we present two proofs of Cayley's theorem that are not as popular as they deserve to be. To set up the story we revisit first some terminology. By a graph G we mean a pair (V (G);E(G)), where V (G) is a set of points (or vertices) and E(G) is a subset of V (G) × V (G). Visually, each element from the set E(G) can be represented as a curve connecting the two corresponding points, thus we will call these the edges of graph G. Note that with the above definition, graphs cannot have multiple edges between two given vertices u and v, but they can have loops (i.e. edges in E(G) of the form (w; w) for w 2 V (G)). However, in this paper we won't allow such pairs. Such simple graphs can be directed or undirected depending on whether the pairs in E(G) ⊂ V (G) × V (G) are ordered or not. A path is a graph P with vertex set V (P ) = fv1; : : : ; vng and edge set E(P ) = f(vi; vi+1) : 1 ≤ i ≤ n − 1g. The number n will be refered to as the length of the path. A cycle (of length n) is a graph C of the form C = P [ (vn; v1). Or in other words, a cycle of length n is a graph obtained from a path of length n by adding an edge between its endpoints.
    [Show full text]
  • Problem Set 2 Out: April 15 Due: April 22
    CS 38 Introduction to Algorithms Spring 2014 Problem Set 2 Out: April 15 Due: April 22 Reminder: you are encouraged to work in groups of two or three; however you must turn in your own write-up and note with whom you worked. You may consult the course notes and the optional text (CLRS). The full honor code guidelines can be found in the course syllabus. Please attempt all problems. To facilitate grading, please turn in each problem on a separate sheet of paper and put your name on each sheet. Do not staple the separate sheets. 1. Recall that a prefix-free encoding scheme can be represented by a binary tree, and that the Huffman code algorithm gives an efficient way to construct an optimal such tree from the probabilities p1; p2; : : : ; pn of n symbols. In this problem, you will show that the average length of such an encoding scheme is at most one larger than the entropy (which is the information- theoretic best-possible). The entropy of the distribution given by p = (p1; p2; : : : ; pn) is defined to be Xn H(p) = − log(pi) · pi: i=1 (a) Prove that for any list of positive integers `1; `2; : : : ; `n satisfying Xn − 2 `i ≤ 1; i=1 there is a binary tree with distinct root-leaf paths having lengths `1; `2; : : : ; `n. Hint: start from the full binary tree and delete subtrees. (b) Let p = (p1; : : : ; pn) give the probabilities of n symbols. Prove that if `1; : : : ; `n are the encoding lengths in an optimal prefix-free encoding scheme for this distribution, then the average encoding length, Xn `ipi; i=1 is at most H(p) + 1.
    [Show full text]