The structure and unlabelled enumeration of toroidal graphs with no K 3,3 s
|
|
- Kevin Ray
- 6 years ago
- Views:
Transcription
1 The structure and unlabelled enumeration of toroidal graphs with no K 3,3 s Andrei Gagarin, Gilbert Labelle, Pierre Leroux 3 Laboratoire de Combinatoire et d Informatique Mathématique (LaCIM) Université du Québec à Montréal (UQAM) Montréal, Québec, Canada Abstract We characterize the toroidal graphs with no K 3,3 -subdivisions as canonical compositions in which -pole planar networs are substituted for the edges of non-planar cores. This structure enables us to enumerate these graphs. We describe an explicit enumerative approach that requires unlabelled enumeration of -connected planar graphs. Keywords: toroidal graph, embedding in a surface, unlabelled enumeration. Introduction We are interested in simple non-planar graphs that can be embedded on the torus or the projective plane. By Kuratowsi s theorem, a graph G is nonplanar if and only if it contains a subdivision of K 5 or K 3,3, and, by Wagner s theorem, a graph G is non-planar if and only if it has a minor isomorphic to K 5 or K 3,3. The graphs with no K 3,3 -subdivisions coincide with the graphs with no K 3,3 -minors. Therefore they are referred to as graphs with no K 3,3 s. gagarin@lacim.uqam.ca labelle.gilbert@uqam.ca 3 leroux.pierre@uqam.ca
2 We describe the structure of -connected non-planar projective-planar and toroidal graphs with no K 3,3 s (denoted respectively by P and T ) in terms of a special substitutional operation G N, where -pole networs of a class N are substituted for the edges of core graphs from a class G. This structure enables us to do the labelled enumeration of graphs in P and T (see [3] and [4]). Here we present the unlabelled enumeration of the same graphs, which is described in detail in [5]. Our enumerative approach is based on Walsh s method [7] rigorized and extended by developing and using general techniques of the theory of species []. Decomposition and structural results A -pole networ (or simply a networ) is a connected graph N with two distinguished vertices 0 and, such that the graph N 0 is -connected (N ab means the graph obtained from N by adding the edge ab if it is absent). The vertices 0 and are called the poles of N, and all the other vertices of N are internal. We define an operator τ acting on -pole networs, N τ N, which interchanges poles 0 and. A class N of networs is called symmetric if N N implies τ N N. A networ N is planar if the graph N 0 is planar. Denote by N P the class of planar networs. The substitution of a -pole networ N for an edge e = uv of a graph G is the set of one or two graphs obtained by replacing the edge e of G with the networ N by identifying the poles of N with the extremities of e (the set of internal vertices of N is disjoint from G). Given a graph G 0 with edges, E = {e,e,...,e }, and a sequence (N,N,...,N ) of networs with disjoint underlying sets, the composition G 0 (N,N,...,N ) is the set of graphs that can be obtained by substituting the networ N j N for the edge e j of G 0, j =,,...,. The graph G 0 is called the core, and the N i s are called components of the resulting graphs. For a class of graphs G and a class of networs N, we denote by G N the class of graphs obtained as compositions G 0 (N,N,...,N ) with G 0 G and N i N, i =,,...,. The composition G N is canonical if for any graph G G N there is a unique core G 0 G and unique (up to pole interchanges) components N,N,...,N N that yield G. Graphs M and M are depicted in Figure. A networ obtained from K 5 by selecting two poles 0 and among the vertices and by removing the edge 0 is called a K 5 \e-networ (see Figure (i)). Denote by C i, i 3, a simple cycle on i vertices. A crown H of K 5 \e-networs is a graph obtained from a cycle C i, i 3, by substituting K 5 \e-networs for some edges of C i in
3 such a way that no two unsubstituted edges of C i are adjacent in H (e.g., see Figure (ii)). Denote by H the class of crowns of K 5 \e-networs. A toroidal core is either K 5, an M-graph, an M -graph, or a crown of K 5 \e-networs. Denote by T C the class of toroidal cores, i.e. T C = K 5 + M + M + H. The following structure theorem is obtained by refining structural and algorithmic results of []. (i) Fig.. (i) The graph M, (ii) The graph M. (ii) 0 (i) Fig.. (i) K 5 \e-networ, (ii) Crown of K 5 \e-networs. Theorem. ([3], [4]) A -connected non-planar graph G with no K 3,3 s is (i) projective-planar if and only if G K 5 N P, and the composition P = K 5 N P is canonical; (ii) toroidal if and only if G T C N P, and the composition T = T C N P is canonical. This characterization enables us to detect toroidal or projective-planar graphs with no K 3,3 s in linear time by analogy with algorithms of [], i.e. by using a breadth-first or depth-first search for the decomposition and by doing a linear-time planarity testing. The linear-time complexity of such an algorithm follows from the linear-time complexity of the decomposition and from the fact that each vertex of the initial graph can appear in at most seven different components. 3 Walsh index series of species of graphs and networs A species is a class C of labelled graphs or networs which is closed under isomorphism. The underlying set of a graph is its vertex set, the underlying set of a networ is the set of its internal vertices, and any isomorphism is induced by a relabelling along a bijection between the underlying sets. A species C is said to be weighted if each structure s of C is assigned a weight (ii)
4 w(s) taen from a commutative ring such that the weight function s w(s) is invariant under isomorphism. For example, given a graph G, we can define the weight w 0 (G) = y m, where m = E(G) and y is a formal variable acting as an edge counter. A species weighted with a function w are denoted by C w. For a species G of graphs weighted with w 0 (G) = y m, the exponential generating function is G(x,y) := G w0 (x) = g n (y) xn n!, n 0 where g n (y) = m 0 g n,my m, g n,m is the number of graphs in G over the set [n] of vertices and having m edges; the ordinary generating function is G(x,y) := G w0 (x) = g n (y)x n, n 0 where g n (y) = m 0 g n,my m, g n,m is the number of isomorphism classes of graphs in G having n vertices and m edges. Analogous generating functions are defined for a species N of -pole networs having n internal vertices, m edges and weighted with the function w 0 (N) = y m. Note that unlabelled - pole networs are isomorphism classes of networs, where any isomorphism ϕ : N N is assumed to be pole-preserving, i.e. ϕ(0) = 0 and ϕ() =. In particular, any automorphism of a networ N should be pole-preserving. We also need to consider the subclass N τ of N consisting of τ-symmetric networs, i.e. networs N such that τ N is isomorphic to N. Suppose we are given a species G of graphs and a symmetric species N of networs such that the composition G N is canonical. In [3] we prove, following Walsh [6], that (G N)(x,y) = G(x, N(x,y)) for the labelled graphs of G N. Here we rigorize and extend the method of Walsh [7] to compute the tilde generating function (G N) (x, y) for unlabelled (G N)-structures. The method of Walsh involves special cycle index series W G (a;b;c), W + N (a;b;c) and W N (a;b;c) in variables a = (a,a,...), b = (b,b,...) and c = (c,c,...). These series are defined as follows. Let G = (V (G),E(G)) be a graph in G. A permutation σ of V (G), which is an automorphism of the graph G, induces a permutation σ () of the set E(G) of edges whose cycles are of two possible sorts: if c is a cycle of σ () of length l, then either σ l (a) = a and σ l (b) = b for each edge e = ab of c (a cylindrical edge cycle), or else σ l (a) = b and σ l (b) = a for each edge e = ab of c (a Möbius edge cycle). For example, the automorphism σ = (,, 3, 4)(5, 6, 7, 8) of the graph of Figure 3(i) induces the cylindrical edge cycle (5, 6, 37, 48), and the automorphism σ = (,, 3, 4, 5, 6, 7, 8) of the graph of Figure 3(ii) induces the Möbius edge cycle (5, 6, 37, 48).
5 (i) (ii) Fig. 3. (i) Cylindrical edge cycle, (ii) Möbius edge cycle. For an automorphism σ Aut(G) of G, denote by σ the number of cycles of length of σ, by cyl (G,σ) the number of cylindrical edge cycles of length, and by möb (G,σ) the number of Möbius edge cycles of length induced by σ in G. Given a graph G G and an automorphism σ of G, the weight w(g,σ) of such a structure is the following cycle index monomial: w(g,σ) = a σ a σ b cyl (G,σ) b cyl (G,σ) c möb (G,σ) c möb (G,σ). Then the Walsh index series W G (a;b;c) of a species G of graphs is defined as W G (a;b;c) = G Typ(G) Aut(G) σ Aut(G) w(g,σ), where the notation G Typ(G) means that the summation should be taen over a set of representatives G of the isomorphism classes of graphs in G. Let σ S[U] be a permutation of the underlying set U of a networ N. We can extend σ to σ + = (0)()σ and to σ = (0, )σ to account for the poles. Denote by ˆN the graph on U {0, } corresponding to a networ N N. Then Aut + (N) = {σ S[U] σ + Aut( ˆN)} and Aut (N) = {σ S[U] σ Aut( ˆN)}. Notice that Aut + (N) = Aut(N). For N N and σ Aut + (N), we assign the weight w(n,σ) = w( ˆN,σ + ), and for N N and σ Aut (N), a we set w(n,σ) = w( ˆN,σ ) a. In other words, only the internal vertex cycles are accounted for. Then, for a species N of networs, the Walsh index series are W + N (a;b;c) = W N (a;b;c) = N Typ(N) N Typ(N τ) Aut + (N) Aut (N) σ Aut + (N) σ Aut (N) w(n,σ), w(n,σ). Proposition 3. Let G be a species of graphs and N be a species of networs. Then the following series identities hold: and
6 G(x,y) =W G (x,x,x 3,...;y,y,y 3,...;y,y,y 3,...), Ñ(x,y) =W + N (x,x,x 3,...;y,y,y 3,...;y,y,y 3,...), Ñ τ (x,y) =W N (x,x,x 3,...;y,y,y 3,...;y,y,y 3,...). Denote by (W + N ) = (W + N ) (a;b;c) = W + N (a,a,...;b,b,...;c,c,...) and by (W N ) = (W N ) (a;b;c) = W N (a,a,...;b,b,...;c,c,...). Theorem 3. Let G be a species of graphs and N be a symmetric species of networs. Then the Walsh index series of the species G N is given by W G N (a;b;c) =W G (a,a,...;(w + N ), (W + N ),...;(W N ), (W N ),...), and the generating function (G N) (x,y) of unlabelled (G N)-structures is (G N) (x,y) = W G (x,x,...;ñ(x,y), Ñ(x,y ),...;Ñτ(x,y), Ñτ(x,y ),...). For a species N B of networs corresponding to a species B of -connected graphs (K B), we have W + N B (a;b;c) = ( + b ) a b W B (a;b;c) and W N B (a;b;c) = ( + c ) a c W B (a;b;c) (see [7]). 4 Walsh index series for the toroidal cores The Walsh index series for the cores K 5, M, and M can be computed by hand, and W + K 5 \e (a;b;c) and W K 5 \e (a;b;c) can be derived from W K 5 (a;b;c) (see [5]). For the Walsh index series W H of the class H of crowns of K 5 \enetwors, we use a variant of Theorem 3., where the K 5 \e-networs are substituted for some edges of a cycle C n (n 3), and the unsubstituted edges form a matching µ of C n. The homogeneous matching polynomial of G is M G (y,z) = y µ z m µ, µ M(G) where M(G) is the set of matchings of the graph G and m = E(G). In particular, we have the homogeneous matching polynomials U n (y,z) = M Pn (y,z) and T n (y,z) = M Cn (y,z), where P n is the path, and C n is the cycle over the set of vertices V = {,,...,n} (see [4]). They satisfy the recurrence relations U n (y,z) = yzu n (y,z) + zu n (y,z), T n (y,z) = yz U n (y,z) + zu n (y,z), for n 3, with the initial values U (y,z) =, U (y,z) = y +z, and T (y,z) = z, T (y,z) = yz + z. Given a graph G with a matching µ, the edges of G are partitioned into two sorts Y and Z depending if they are in µ (sort Y ) or not (sort Z). An and
7 automorphism σ of a matched graph (G,µ) is an automorphism σ of G that leaves the matching fixed, i.e. σ(µ) = µ. This induces cylindrical and Möbius edge cycles of sort Y, counted by the variables b,b,... and c,c,..., respectively, and cylindrical and Möbius edge cycles of sort Z, counted by the variables β,β,... and γ,γ,..., respectively. Let w µ (σ) denote the cycle index monomial: b cyl,y (σ) w µ (σ) = a σ γ möb,z(σ), where cyl,y (σ), möb,y (σ), cyl,z (σ) and möb,z (σ) denote the number of cylindrical and Möbius edge cycles of length and of sort Y or Z, respectively. Then we set W m G (a,b,c,β,γ) = G Typ(G) c möb,y (σ) Aut(G) β cyl,z (σ) σ Aut(G) µ Fix m (σ) w µ (σ), where Fix m (σ) denotes the set of matchings µ of G fixed by σ. Proposition 4. The Walsh index series W G m Z N(a;b;c) can be obtained from the extended Walsh index series WG m (a;b;c;β;γ) by W G m Z N(a;b;c) = W m G (a;b;c; (W + N ), (W + N ),...;(W N ), (W N ),...). By applying Proposition 4. with G = C = n 3 C n and N = K 5 \e, W H (a;b;c) for the species H of crowns of K 5 \e-networs can be calculated as W H (a;b;c) = W m C (a;b;c; (W + K 5 \e ), (W + K 5 \e ),...;(W K 5 \e ), (W K 5 \e ),...). The extended Walsh index series W m C n (a;b;c;β;γ) for matched cycles of size n, n 3, can be computed by using the extended Walsh index series of matched paths and the Walsh index series of cycles (see [5]). The result is Theorem 4. The extended Walsh index series WC m n, n 3, is given by WC m n (a;b;c;β;γ) = φ( n n d )ad nt d (b n,β n ) d d d for n odd, and by W m C n (a;b;c;β;γ) = n d n + a a n d n (β γ U n (b,β ) + βc U n 3(b,β )), φ( n d )ad nt d (b n,β n ) + d d d 4 [a a n β Un +a n (γun (b,β ) + c γ β U n (b,β ) +c β Un 4(b,β ))], for n even, where φ is the Euler φ-function. (b,β )
8 Thus, we can compute the Walsh index series W H (a;b;c) of the species H of crowns of K 5 \e-networs by using W m C = n 3 W m C n, W + K 5 \e, and W K 5 \e in Proposition 4.. Computational results are presented in Table. To count Table The number t C (n) of unlabelled toroidal cores (having n vertices). n t C (n) n t C (n) n t C (n) unlabelled toroidal graphs with no K 3,3 s, it is necessary to use the generating functions for unlabelled planar networs N P and unlabelled τ-symmetric planar networs N P,τ. It is still not nown how to compute efficiently these power series. However, we enumerated planar networs of small size (see [5]). References [] Bergeron, F., G. Labelle, and P. Leroux, Combinatorial Species and Tree-lie Structures, Cambrige Univ. Press, 998. [] Gagarin, A., and W. Kocay, Embedding graphs containing K 5 -subdivisions, Ars Combin. 64 (00), [3] Gagarin, A., G. Labelle, and P. Leroux, Structure and labelled enumeration of K 3,3 -subdivision-free projective-planar graphs, Pure Math. Appl. (005), to appear. Preprint: arxiv:math.co/ [4] Gagarin, A., G. Labelle, and P. Leroux, Characterization and enumeration of toroidal K 3,3 -subdivision-free graphs, submitted, 004. Preprint: arxiv:math.co/ [5] Gagarin, A., G. Labelle, and P. Leroux, Counting unlabelled toroidal graphs with no K 3,3 -subdivisions, Adv. in Appl. Math. (006), to appear. Preprint: arxiv:math.co/ [6] Walsh, T.R.S., Counting labelled three-connected and homeomorphically irreducible two-connected graphs, J. Combin. Theory Ser. B 3 (98),. [7] Walsh, T.R.S., Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs, J. Combin. Theory Ser. B 3 (98), 3.
Forbidden minors and subdivisions for toroidal graphs with no K 3,3 s
Forbidden minors and subdivisions for toroidal graphs with no K 3,3 s Andrei Gagarin 2 Laboratoire de Combinatoire et d Informatique Mathématique (LaCIM) Université du Québec à Montréal (UQAM) Montréal,
More informationA Complete Grammar for Decomposing a Family of Graphs into 3-connected Components
A Complete Grammar for Decomposing a Family of Graphs into 3-connected Components Guillaume Chapuy 1, Éric Fusy2, Mihyun Kang 3 and Bilyana Shoilekova 4 Submitted: Sep 17, 2008; Accepted: Nov 30, 2008;
More informationEDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m
EDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m GARY MACGILLIVRAY BEN TREMBLAY Abstract. We consider homomorphisms and vertex colourings of m-edge-coloured graphs that have a switching operation
More informationarxiv: v1 [cs.dm] 13 Apr 2012
A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs Vít Jelínek, Jan Kratochvíl, Ignaz Rutter arxiv:1204.2915v1 [cs.dm] 13 Apr 2012 Abstract A partially embedded graph (or Peg) is a triple
More informationA graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.
2301-670 Graph theory 1.1 What is a graph? 1 st semester 2550 1 1.1. What is a graph? 1.1.2. Definition. A graph G is a triple (V(G), E(G), ψ G ) consisting of V(G) of vertices, a set E(G), disjoint from
More informationEmbeddings of Small Graphs on the Torus
June, 00 This article appeared in CUBO (00), - Embeddings of Small Graphs on the Torus Andrei Gagarin, William Kocay* and Daniel Neilson Computer Science Department University of Manitoba Winnipeg, Manitoba,
More informationarxiv: v1 [math.co] 4 Sep 2017
Abstract Maximal chord diagrams up to all isomorphisms are enumerated. The enumerating formula is based on a bijection between rooted one-vertex one-face maps on locally orientable surfaces andacertain
More informationarxiv: v4 [math.co] 4 Apr 2011
Upper-critical graphs (complete k-partite graphs) José Antonio Martín H. Faculty of Computer Science, Complutense University of Madrid, Spain arxiv:1011.4124v4 [math.co] 4 Apr 2011 Abstract This work introduces
More informationMath 776 Graph Theory Lecture Note 1 Basic concepts
Math 776 Graph Theory Lecture Note 1 Basic concepts Lectured by Lincoln Lu Transcribed by Lincoln Lu Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved
More informationMath 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem
Math 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem David Glickenstein November 26, 2008 1 Graph minors Let s revisit some de nitions. Let G = (V; E) be a graph. De nition 1 Removing
More informationMAS341 Graph Theory 2015 exam solutions
MAS4 Graph Theory 0 exam solutions Question (i)(a) Draw a graph with a vertex for each row and column of the framework; connect a row vertex to a column vertex if there is a brace where the row and column
More informationPlanarity: dual graphs
: dual graphs Math 104, Graph Theory March 28, 2013 : dual graphs Duality Definition Given a plane graph G, the dual graph G is the plane graph whose vtcs are the faces of G. The correspondence between
More informationElements of Graph Theory
Elements of Graph Theory Quick review of Chapters 9.1 9.5, 9.7 (studied in Mt1348/2008) = all basic concepts must be known New topics we will mostly skip shortest paths (Chapter 9.6), as that was covered
More informationAssignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
More informationMath 778S Spectral Graph Theory Handout #2: Basic graph theory
Math 778S Spectral Graph Theory Handout #: Basic graph theory Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved the Königsberg Bridge problem: Is it possible
More informationCS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK
CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK 1. Define Graph. 2. Define Simple graph. 3. Write few problems
More informationOn the Relationships between Zero Forcing Numbers and Certain Graph Coverings
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,
More informationMissouri State University REU, 2013
G. Hinkle 1 C. Robichaux 2 3 1 Department of Mathematics Rice University 2 Department of Mathematics Louisiana State University 3 Department of Mathematics Missouri State University Missouri State University
More informationCounting unlabeled k-trees
Counting unlabeled k-trees Andrew Gainer-Dewar a, Ira M. Gessel b,1 a Department of Mathematics, Carleton College, Northfield, MN 55057 b Department of Mathematics, Brandeis University, MS 050, Waltham,
More informationarxiv: v1 [math.co] 28 Nov 2016
Trees with distinguishing number two arxiv:1611.09291v1 [math.co] 28 Nov 2016 Saeid Alikhani May 15, 2018 Samaneh Soltani Department of Mathematics, Yazd University, 89195-741, Yazd, Iran alikhani@yazd.ac.ir,
More informationOn median graphs and median grid graphs
On median graphs and median grid graphs Sandi Klavžar 1 Department of Mathematics, PEF, University of Maribor, Koroška cesta 160, 2000 Maribor, Slovenia e-mail: sandi.klavzar@uni-lj.si Riste Škrekovski
More informationLemma. Let G be a graph and e an edge of G. Then e is a bridge of G if and only if e does not lie in any cycle of G.
Lemma. Let G be a graph and e an edge of G. Then e is a bridge of G if and only if e does not lie in any cycle of G. Lemma. If e = xy is a bridge of the connected graph G, then G e consists of exactly
More informationSmarandache Directionally n-signed Graphs A Survey
International J.Math. Combin. Vol.2(2013), 34-43 Smarandache Directionally n-signed Graphs A Survey P.Siva Kota Reddy (Department of Mathematics, Acharya Institute of Technology, Soladevanahalli, Bangalore-560
More informationOn Possible Counterexamples to Negami s Planar Cover Conjecture
On Possible Counterexamples to Negami s Planar Cover Conjecture Petr Hliněný and Robin Thomas School of Mathematics, Georgia Institute of Technology, Atlanta GA 0-00, U.S.A. hlineny@member.ams.org June,
More informationBAR-MAGNET POLYHEDRA AND NS-ORIENTATIONS OF MAPS
University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Jadranska 19, 1111 Ljubljana, Slovenia Preprint series, Vol. 42 (2004), 940 BAR-MAGNET POLYHEDRA AND NS-ORIENTATIONS
More informationMultivariate Lagrange inversion formula and the cycle lemma
Multivariate Lagrange inversion formula and the cycle lemma Axel Bacher and Gilles Schaeffer Université Paris Nord, and CNRS / École Polytechnique Abstract. We give a multitype extension of the cycle lemma
More informationPlanarity. 1 Introduction. 2 Topological Results
Planarity 1 Introduction A notion of drawing a graph in the plane has led to some of the most deep results in graph theory. Vaguely speaking by a drawing or embedding of a graph G in the plane we mean
More informationLecture 11 COVERING SPACES
Lecture 11 COVERING SPACES A covering space (or covering) is not a space, but a mapping of spaces (usually manifolds) which, locally, is a homeomorphism, but globally may be quite complicated. The simplest
More informationGraph Theory: Introduction
Graph Theory: Introduction Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT Kharagpur pallab@cse.iitkgp.ernet.in Resources Copies of slides available at: http://www.facweb.iitkgp.ernet.in/~pallab
More informationCrossing numbers of Sierpiński-like graphs
Crossing numbers of Sierpiński-like graphs Sandi Klavžar Department of Mathematics, PeF, University of Maribor Koroška cesta 160, 2000 Maribor, Slovenia sandi.klavzar@uni-mb.si Bojan Mohar Department of
More informationChordal graphs MPRI
Chordal graphs MPRI 2017 2018 Michel Habib habib@irif.fr http://www.irif.fr/~habib Sophie Germain, septembre 2017 Schedule Chordal graphs Representation of chordal graphs LBFS and chordal graphs More structural
More informationMirrors of reflections of regular maps
ISSN 1855-3966 (printed edn), ISSN 1855-3974 (electronic edn) ARS MATHEMATICA CONTEMPORANEA 15 (018) 347 354 https://doiorg/106493/1855-3974145911d (Also available at http://amc-journaleu) Mirrors of reflections
More informationUnlabeled equivalence for matroids representable over finite fields
Unlabeled equivalence for matroids representable over finite fields November 16, 2012 S. R. Kingan Department of Mathematics Brooklyn College, City University of New York 2900 Bedford Avenue Brooklyn,
More informationON LEIGHTON S GRAPH COVERING THEOREM. Theorem (Leighton [5]). Two finite graphs which have a common covering have a common finite covering.
ON LEIGHTON S GRAPH COVERING THEOREM WALTER D. NEUMANN Abstract. We give short expositions of both Leighton s proof and the Bass- Kulkarni proof of Leighton s graph covering theorem, in the context of
More informationCombinatorial Algebraic Topology and applications to Distributed Computing
Combinatorial Algebraic Topology and applications to Distributed Computing Dmitry Feichtner-Kozlov University of Bremen XXIst Oporto Meeting on Geometry, Topology and Physics LISSABON 2015 Lecture I: Simplicial
More informationAlgebra II: Review Exercises
: Review Exercises These notes reflect material from our text, A First Course in Abstract Algebra, Seventh Edition, by John B. Fraleigh, published by Addison-Wesley, 2003. Chapter 7. Advanced Group Theory
More informationINTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES
INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES RACHEL CARANDANG Abstract. This paper provides an overview of the homology groups of a 2- dimensional complex. It then demonstrates a proof of the Invariance
More informationMINIMAL FREE RESOLUTIONS OF COMPLETE BIPARTITE GRAPH IDEALS
MINIMAL FREE RESOLUTIONS OF COMPLETE BIPARTITE GRAPH IDEALS DANIEL VISSCHER Department of Mathematics, St. Olaf College, Northfield, MN 55057, USA visscher@stolaf.edu Abstract. This paper gives an explicit
More informationON THE STRUCTURE OF SELF-COMPLEMENTARY GRAPHS ROBERT MOLINA DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE ALMA COLLEGE ABSTRACT
ON THE STRUCTURE OF SELF-COMPLEMENTARY GRAPHS ROBERT MOLINA DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE ALMA COLLEGE ABSTRACT A graph G is self complementary if it is isomorphic to its complement G.
More informationSuppose we have a function p : X Y from a topological space X onto a set Y. we want to give a topology on Y so that p becomes a continuous map.
V.3 Quotient Space Suppose we have a function p : X Y from a topological space X onto a set Y. we want to give a topology on Y so that p becomes a continuous map. Remark If we assign the indiscrete topology
More informationMath 777 Graph Theory, Spring, 2006 Lecture Note 1 Planar graphs Week 1 Weak 2
Math 777 Graph Theory, Spring, 006 Lecture Note 1 Planar graphs Week 1 Weak 1 Planar graphs Lectured by Lincoln Lu Definition 1 A drawing of a graph G is a function f defined on V (G) E(G) that assigns
More informationVertex-transitive direct products of graphs
Vertex-transitive direct products of graphs Richard H. Hammack Department of Mathematics Virginia Commonwealth University Richmond, Virginia U.S.A. rhammack@vcu.edu Wilfried Imrich Dept. of Mathematics
More informationLecture 4: Bipartite graphs and planarity
Lecture 4: Bipartite graphs and planarity Anders Johansson 2011-10-22 lör Outline Bipartite graphs A graph G is bipartite with bipartition V1, V2 if V = V1 V2 and all edges ij E has one end in V1 and V2.
More informationFace two-colourable triangulations of K 13
Face two-colourable triangulations of K 13 M. J. Grannell, T. S. Griggs Department of Pure Mathematics The Open University Walton Hall Milton Keynes MK7 6AA UNITED KINGDOM M. Knor Department of Mathematics
More informationProduct constructions for transitive decompositions of graphs
116 Product constructions for transitive decompositions of graphs Geoffrey Pearce Abstract A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition
More informationA more efficient algorithm for perfect sorting by reversals
A more efficient algorithm for perfect sorting by reversals Sèverine Bérard 1,2, Cedric Chauve 3,4, and Christophe Paul 5 1 Département de Mathématiques et d Informatique Appliquée, INRA, Toulouse, France.
More informationCOLOURINGS OF m-edge-coloured GRAPHS AND SWITCHING
COLOURINGS OF m-edge-coloured GRAPHS AND SWITCHING GARY MACGILLIVRAY AND J. MARIA WARREN Abstract. Graphs with m disjoint edge sets are considered, both in the presence of a switching operation and without
More informationGRAPH THEORY and APPLICATIONS. Planar Graphs
GRAPH THEORY and APPLICATIONS Planar Graphs Planar Graph A graph is planar if it can be drawn on a plane surface with no two edges intersecting. G is said to be embedded in the plane. We can extend the
More informationOn vertex-degree restricted subgraphs in polyhedral graphs
Discrete Mathematics 256 (2002) 105 114 www.elsevier.com/locate/disc On vertex-degree restricted subgraphs in polyhedral graphs Igor Fabrici Department of Mathematics, Technical University Ilmenau, PF
More informationThe optimal routing of augmented cubes.
The optimal routing of augmented cubes. Meirun Chen, Reza Naserasr To cite this version: Meirun Chen, Reza Naserasr. The optimal routing of augmented cubes.. Information Processing Letters, Elsevier, 28.
More informationTHE UNIVERSAL EDGE ELIMINATION POLYNOMIAL AND THE DICHROMATIC POLYNOMIAL
THE UNIVERSAL EDGE ELIMINATION POLYNOMIAL AND THE DICHROMATIC POLYNOMIAL I. AVERBOUCH, T. KOTEK, J.A. MAKOWSKY, AND E. RAVVE Abstract. The dichromatic polynomial Z(G; q, v) can be characterized as the
More informationGood Will Hunting s Problem: Counting Homeomorphically Irreducible Trees
Good Will Hunting s Problem: Counting Homeomorphically Irreducible Trees Ira M. Gessel Department of Mathematics Brandeis University Brandeis University Combinatorics Seminar September 18, 2018 Good Will
More informationPACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed
More informationJordan Curves. A curve is a subset of IR 2 of the form
Jordan Curves A curve is a subset of IR 2 of the form α = {γ(x) : x [0, 1]}, where γ : [0, 1] IR 2 is a continuous mapping from the closed interval [0, 1] to the plane. γ(0) and γ(1) are called the endpoints
More informationSymmetric Product Graphs
Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 5-20-2015 Symmetric Product Graphs Evan Witz Follow this and additional works at: http://scholarworks.rit.edu/theses
More informationArboreal Dessins D enfants David P. Roberts University of Minnesota, Morris. 2. Rational functions and moduli algebras
Arboreal Dessins D enfants David P. Roberts University of Minnesota, Morris 1. Warm-up activity: a tree game 2. Rational functions and moduli algebras 3. Dessins d enfants 4. The arboreal case 5. The discriminant
More informationarxiv:math.co/ v1 27 Jan 2006
Bijective counting of tree-rooted maps and shuffles of parenthesis systems Olivier Bernardi arxiv:math.co/0601684 v1 27 Jan 2006 Abstract The number of tree-rooted maps, that is, rooted planar maps with
More informationHamiltonian cycles in bipartite quadrangulations on the torus
Hamiltonian cycles in bipartite quadrangulations on the torus Atsuhiro Nakamoto and Kenta Ozeki Abstract In this paper, we shall prove that every bipartite quadrangulation G on the torus admits a simple
More informationProper Partitions of a Polygon and k-catalan Numbers
Proper Partitions of a Polygon and k-catalan Numbers Bruce E. Sagan Department of Mathematics Michigan State University East Lansing, MI 48824-1027 USA sagan@math.msu.edu July 13, 2005 Abstract Let P be
More informationDissections of polygons into convex polygons
Dissections of polygons into convex polygons Andrzej Żak Faculty of Applied Mathematics, AGH University of Science and Technology al. Mickiewicza 30, 30 059 Kraków, Poland e-mail: zakandrz@uci.agh.edu.pl
More informationarxiv:submit/ [math.co] 9 May 2011
arxiv:submit/0243374 [math.co] 9 May 2011 Connectivity and tree structure in finite graphs J. Carmesin R. Diestel F. Hundertmark M. Stein 6 May, 2011 Abstract We prove that, for every integer k 0, every
More informationTHE DESCENT STATISTIC ON 123-AVOIDING PERMUTATIONS
Séminaire Lotharingien de Combinatoire 63 (2010), Article B63a THE DESCENT STATISTIC ON 123-AVOIDING PERMUTATIONS MARILENA BARNABEI, FLAVIO BONETTI, AND MATTEO SILIMBANI Abstract. We exploit Krattenthaler
More informationThe Graphs of Triangulations of Polygons
The Graphs of Triangulations of Polygons Matthew O Meara Research Experience for Undergraduates Summer 006 Basic Considerations Let Γ(n) be the graph with vertices being the labeled planar triangulation
More informationLecture 3: Recap. Administrivia. Graph theory: Historical Motivation. COMP9020 Lecture 4 Session 2, 2017 Graphs and Trees
Administrivia Lecture 3: Recap Assignment 1 due 23:59 tomorrow. Quiz 4 up tonight, due 15:00 Thursday 31 August. Equivalence relations: (S), (R), (T) Total orders: (AS), (R), (T), (L) Partial orders: (AS),
More informationBijective counting of tree-rooted maps and shuffles of parenthesis systems
Bijective counting of tree-rooted maps and shuffles of parenthesis systems Olivier Bernardi Submitted: Jan 24, 2006; Accepted: Nov 8, 2006; Published: Jan 3, 2006 Mathematics Subject Classifications: 05A15,
More informationThe Structure of Bull-Free Perfect Graphs
The Structure of Bull-Free Perfect Graphs Maria Chudnovsky and Irena Penev Columbia University, New York, NY 10027 USA May 18, 2012 Abstract The bull is a graph consisting of a triangle and two vertex-disjoint
More informationGenerating Functions for Hyperbolic Plane Tessellations
Generating Functions for Hyperbolic Plane Tessellations by Jiale Xie A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in
More informationHW Graph Theory Name (andrewid) - X. 1: Draw K 7 on a torus with no edge crossings.
1: Draw K 7 on a torus with no edge crossings. A quick calculation reveals that an embedding of K 7 on the torus is a -cell embedding. At that point, it is hard to go wrong if you start drawing C 3 faces,
More informationMath 443/543 Graph Theory Notes 5: Planar graphs and coloring
Math 443/543 Graph Theory Notes 5: Planar graphs and coloring David Glickenstein October 10, 2014 1 Planar graphs The Three Houses and Three Utilities Problem: Given three houses and three utilities, can
More informationThe Cartesian product of cycles C n1, C n2,, C ns, denoted C n1 C n2 C ns can be viewed as the Cayley graph of Abelian group Z n1 Z n2 Z ns
Vertex-magic edge Z 2nm -labeling of C n C m Dalibor Froncek, University of Minnesota Duluth James McKeown, University of Miami John McKeown, University of Minnesota Duluth Michael McKeown, University
More information4. Simplicial Complexes and Simplicial Homology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n
More informationLine Graphs and Circulants
Line Graphs and Circulants Jason Brown and Richard Hoshino Department of Mathematics and Statistics Dalhousie University Halifax, Nova Scotia, Canada B3H 3J5 Abstract The line graph of G, denoted L(G),
More informationThe following is a summary, hand-waving certain things which actually should be proven.
1 Basics of Planar Graphs The following is a summary, hand-waving certain things which actually should be proven. 1.1 Plane Graphs A plane graph is a graph embedded in the plane such that no pair of lines
More informationJordan Curves. A curve is a subset of IR 2 of the form
Jordan Curves A curve is a subset of IR 2 of the form α = {γ(x) : x [0,1]}, where γ : [0,1] IR 2 is a continuous mapping from the closed interval [0,1] to the plane. γ(0) and γ(1) are called the endpoints
More informationReference Sheet for CO142.2 Discrete Mathematics II
Reference Sheet for CO14. Discrete Mathematics II Spring 017 1 Graphs Defintions 1. Graph: set of N nodes and A arcs such that each a A is associated with an unordered pair of nodes.. Simple graph: no
More informationON LEIGHTON S GRAPH COVERING THEOREM. Theorem (Leighton [5]). Two finite graphs which have a common covering have a common finite covering.
ON LEIGHTON S GRAPH COVERING THEOREM WALTER D. NEUMANN Abstract. We give short expositions of both Leighton s proof and the Bass- Kulkarni proof of Leighton s graph covering theorem, in the context of
More informationCayley graphs and coset diagrams/1
1 Introduction Cayley graphs and coset diagrams Let G be a finite group, and X a subset of G. The Cayley graph of G with respect to X, written Cay(G, X) has two different definitions in the literature.
More informationMath 170- Graph Theory Notes
1 Math 170- Graph Theory Notes Michael Levet December 3, 2018 Notation: Let n be a positive integer. Denote [n] to be the set {1, 2,..., n}. So for example, [3] = {1, 2, 3}. To quote Bud Brown, Graph theory
More informationarxiv: v1 [math.co] 9 Dec 2015
ALGEBRAIC DISCRETE MORSE THEORY FOR THE HULL RESOLUTION arxiv:1512.03045v1 [math.co] 9 Dec 2015 PATRIK NORÉN Abstract. We study how powerful algebraic discrete Morse theory is when applied to hull resolutions.
More informationGraceful and odd graceful labeling of graphs
International Journal of Mathematics and Soft Computing Vol.6, No.2. (2016), 13-19. ISSN Print : 2249 3328 ISSN Online: 2319 5215 Graceful and odd graceful labeling of graphs Department of Mathematics
More informationIntroduction III. Graphs. Motivations I. Introduction IV
Introduction I Graphs Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Graph theory was introduced in the 18th century by Leonhard Euler via the Königsberg
More informationCS 311 Discrete Math for Computer Science Dr. William C. Bulko. Graphs
CS 311 Discrete Math for Computer Science Dr. William C. Bulko Graphs 2014 Definitions Definition: A graph G = (V,E) consists of a nonempty set V of vertices (or nodes) and a set E of edges. Each edge
More informationPrice of Connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs
Price of Connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs Eglantine Camby Université Libre de Bruxelles, Brussels, Belgium GERAD
More informationA combinatorial proof of a formula for Betti numbers of a stacked polytope
A combinatorial proof of a formula for Betti numbers of a staced polytope Suyoung Choi Department of Mathematical Sciences KAIST, Republic of Korea choisy@aistacr (Current Department of Mathematics Osaa
More informationThis article was originally published in a journal published by Elsevier, and the attached copy is provided by Elsevier for the author s benefit and for the benefit of the author s institution, for non-commercial
More informationComputing NodeTrix Representations of Clustered Graphs
Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 22, no. 2, pp. 139 176 (2018) DOI: 10.7155/jgaa.00461 Computing NodeTrix Representations of Clustered Graphs Giordano Da Lozzo Giuseppe
More informationIntersection-Link Representations of Graphs
Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 21, no. 4, pp. 731 755 (2017) DOI: 10.7155/jgaa.00437 Intersection-Link Representations of Graphs Patrizio Angelini 1 Giordano Da Lozzo
More informationCUBICAL SIMPLICIAL VOLUME OF SURFACES
CUBICAL SIMPLICIAL VOLUME OF SURFACES CLARA LÖH AND CHRISTIAN PLANKL ABSTRACT. Cubical simplicial volume is a variation on simplicial volume, based on cubes instead of simplices. Both invariants are homotopy
More informationGraph Theory S 1 I 2 I 1 S 2 I 1 I 2
Graph Theory S I I S S I I S Graphs Definition A graph G is a pair consisting of a vertex set V (G), and an edge set E(G) ( ) V (G). x and y are the endpoints of edge e = {x, y}. They are called adjacent
More informationAutomorphism Groups of Cyclic Polytopes
8 Automorphism Groups of Cyclic Polytopes (Volker Kaibel and Arnold Waßmer ) It is probably well-known to most polytope theorists that the combinatorial automorphism group of a cyclic d-polytope with n
More informationReachability in K 3,3 -free and K 5 -free Graphs is in Unambiguous Logspace
CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE 2014, Article 2, pages 1 29 http://cjtcs.cs.uchicago.edu/ Reachability in K 3,3 -free and K 5 -free Graphs is in Unambiguous Logspace Thomas Thierauf Fabian
More informationDiscrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London
Discrete Mathematics SECOND EDITION Norman L. Biggs Professor of Mathematics London School of Economics University of London OXFORD UNIVERSITY PRESS Contents PART I FOUNDATIONS Statements and proofs. 1
More informationModuli spaces in genus zero and inversion of power series
Moduli spaces in genus zero and inversion of power series Curtis T. McMullen 1 October 2012 Let M 0,n denote the moduli space Riemann surfaces of genus 0 with n ordered marked points. Its Deligne-Mumford
More informationOn the number of optimal surfaces.
On the number of optimal surfaces. Alina Vdovina School of Mathematics and Statistics Newcastle University Newcastle-upon-Tyne NE1 7RU, UK e-mail: alina.vdovina@ncl.ac.uk Abstract Let X be a compact Riemann
More informationGenus of the cartesian product of triangles
Genus of the cartesian product of triangles Michal Kotrbčík Faculty of Informatics Masaryk University Brno, Czech Republic kotrbcik@fi.muni.cz Tomaž Pisanski FAMNIT University of Primorska Koper, Slovenia
More informationAdjacent: Two distinct vertices u, v are adjacent if there is an edge with ends u, v. In this case we let uv denote such an edge.
1 Graph Basics What is a graph? Graph: a graph G consists of a set of vertices, denoted V (G), a set of edges, denoted E(G), and a relation called incidence so that each edge is incident with either one
More informationSignatures of Combinatorial Maps
Signatures of Combinatorial Maps No Author Given No Institute Given Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. For that,
More informationSimultaneous Diagonal Flips in Plane Triangulations
@ _ d j 5 6 5 6 Simultaneous Diagonal Flips in Plane Triangulations Prosenjit Bose Jurek Czyzowicz Zhicheng Gao Pat Morin David R. Wood Abstract Simultaneous diagonal flips in plane triangulations are
More informationFrom Wikipedia, the free encyclopedia
Page 1 of 7 Planar graph From Wikipedia, the free encyclopedia In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges
More informationBranched coverings and three manifolds Third lecture
J.M.Montesinos (Institute) Branched coverings Hiroshima, March 2009 1 / 97 Branched coverings and three manifolds Third lecture José María Montesinos-Amilibia Universidad Complutense Hiroshima, March 2009
More information