AN ALGORITHM WHICH GENERATES THE HAMILTONIAN CIRCUITS OF A CUBIC PLANAR MAP
|
|
- Derek Tate
- 6 years ago
- Views:
Transcription
1 AN ALGORITHM WHICH GENERATES THE HAMILTONIAN CIRCUITS OF A CUBIC PLANAR MAP W. L. PRICE ABSTRACT The paper describes an algorithm which generates those Hamiltonian circuits of a given cubic planar map which include some chosen edge of the map. A simple extension of the method results in the generation of all the Hamiltonian circuits of the map. The algorithm can readily be implemented on a digital computer, subject to limitations on storage. A general property of the generating function defined by the algorithm leads to a proof th t the total number of Hamiltonian circuits which include any given edge of a cubic planar map is even. Does the structure of the function yield further information concerning the properties of the family of Hamiltonian circuits? 1. Introduction 1.1. Algorithms which determine the family of Hamiltonian circuits in a graph are generally of one of two kinds: either they are based on algebraic methods which attempt to find all the Hamiltonian circuits at once, or they depend on enumerative techniques in which the Hamiltonian circuits are found one at a time. Christofides (1975) describes an algebraic method based on the work of Yau (1967), Danielson (1968) and Dhawan (1969) which involves successive matrix multiplications, starting with the adjacency matrix for the graph. Such methods make considerable demands on computer storage and processing time and become impracticable for graphs which have more than a few tens of vertices. Enumerative methods, such as those of Roberts and Flores (1966) and Selby (1970), consider one simple chain at a time, the chain being continuously extended until either a Hamiltonian circuit is obtained or it becomes apparent that the chain cannot lead to a Hamiltonian circuit, in which case the chain is modified in a systematic way and the search continues. A relatively small amount of computer storage is required for enumerative search The algorithm described in this paper is specific to cubic planar maps, rather than graphs in general, and is of the type which generates all Hamiltonian circuits simultaneously. The procedure involves iterative multiplication of simple expressions rather than matrix operations, and as such it makes the minimum possible demand on computer storage for a method of this type. The primary purpose of this algorithm is not, however, to determine the Hamiltonian circuits of particular cubic planar maps it was devised by the author principally as a means to establish general properties of the family of Hamiltonian circuits in such maps. It will be shown that the properties of the generating function implicit in the algorithm lead to a proof of the well known result, first published by Tutte (1946), that the total number of Hamiltonian circuits which include any given edge of a cubic planar map is always even. The method seems potentially capable of establishing further properties of the family of Hamiltonian circuits in a cubic planar map and of relating these properties to the topology of the map. Received 13 September, 1976; revised 8 March, [J. LONDON MATH. SOC. (2), 18 (1978), ]
2 194 W. L. PRICE 1.3. The term CP-map will be used to denote a cubic planar map which is connected and which has no isthmuses or multiple edges. The dual of such a map will be termed a CP-dual. A CP-dual is planar, connected and has no loops or multiple edges. Each face of a CP-dual is triangular To each Hamiltonian circuit (H-circuit) in a CP-map there corresponds a particular two-tree in the CP-dual such that the tree edges are in one-one correspondence with the non-circuit edges in the CP-map. Such a two-tree will be termed an H-tree; it has the property that one, and only one, tree edge is associated with each face of the CP-dual. Fig. 3 shows the family of seven H-circuits in a particular <5P-map, M l5 together with the set of corresponding H-trees in the CP-dual, D {. 2. The generating algorithm 2.1. The algorithm generates directly the subset {H E } of {//}, where {H} denotes the set of all H-circuits of a CP-map, M, and {H E } represents those members of {H} which include an arbitrarily chosen edge, E, of M. The formal specification of the algorithm will follow a preliminary discussion of the underlying principle To each H-circuit in M which includes E there corresponds an H-tree in the CP-dual, D, which excludes the edge E', where ' in D corresponds to E in M. In the context of this algorithm it is convenient to assign a direction to each of the tree edges of the H-tree, the directions being dependent on the choice of E'. The two vertices in D which are connected by E' are the root vertices of the directed twotree, and the tree edges are directed towards the root vertices. In Fig. 1 an H-tree of a particular CP-dual, D lt is drawn so as to show the edge directions appropriate to the choice of g and h as root vertices. It is evident that from each vertex of D it other than the root vertices, there emanates exactly one outwardly directed edge. This property clearly extends to any H-tree by virtue of the properties of the tree structure Assume that M (and hence D) is given and that some edge E of M (and hence E' of D) is specified. Suppose that a sub-set of the edges of D be assigned directions in such a way as to satisfy each of the two conditions which follow. Condition 1. Let the two vertices connected by E' be the root vertices and from each vertex of D other than the root vertices let one, and only one, of the incident edges be chosen as an outwardly directed edge. If Condition 1 is satisfied then, starting from any vertex other than a root vertex, and following only directed edges, one proceeds by a unique path which either terminates in a root vertex or enters a directed circuit. (The chosen edges cannot form a circuit other than a directed circuit, for this would imply that at least one vertex possesses more than one outwardly directed edge). Condition 2. Let the directed edges be so chosen that not more than one directed edge bounds each triangular face of D. The next step is to prove that if Condition 2 is satisfied then directed circuits cannot arise. Consider a circuit formed by a set of directed edges satisfying Condition 1. Because the two root vertices are connected by the edge ', which is not
3 THE HAMILTONIAN CIRCUITS OF A CUBIC PLANAR MAP 195 a directed edge and hence is not on the circuit, it follows that the root vertices both lie on the same side of the circuit. Consider that region, R, of D which is bounded by the circuit and which does not contain the root vertices. Let n be the number of edges on the circuit, and let v,f, e be respectively the number of vertices, faces and edges within R. Applying Euler's relation to the region R gives and because each face is triangular it follows that Hence, eliminating e, 3f=n + 2e. 2v+n=f+2. Now the number of directed edges arising within R is v (one for each internal vertex) and each of these is associated with two faces. The number of directed edges on the circuit is n and each of these is associated with one face within R. But 2v + n =/+2 >/, hence it cannot be true that each of the faces is bounded by only one directed edge and Condition 2 is violated. Therefore if both Conditions 1 and 2 are satisfied it follows that circuits cannot arise and the directed edges constitute an H-tree in D to which there corresponds an H-circuit in M within the set 2.4. The foregoing principle suggests the following algorithmic procedure. 1. Let each triangular face of D be arbitrarily assigned an index number (represented by p, q,r...) and each vertex an index letter (represented by a, b,c,... k,...). Let each edge be denoted by an un-ordered number pair (p, q) where p and q are the index numbers of the faces which are separated by that edge. 2. For each vertex, k, other than the two root vertices (those associated with the specified edge E'), form the vertex sum where each term corresponds to an edge incident on that vertex. 3. Form the product function f E. = s a *s b *s c... of all these vertex sums where the product operator * is defined as follows: The product s a * s b is the sum of terms such as (p, q) (r, s) where (p, q) is any term in s a and (r, s) any term in s b such that the index numbers p, q, r, s are all different. Thus, if s a includes the term (1, 2) and s b includes the terms (2, 5) and (3, 4), the product s a * s b will include the term (1, 2) (3, 4) but not (1, 2) (2, 5). No significance attaches to the ordering of the product terms, thus (1, 2) (3, 4) = (3,4) (1, 2) = (4, 3) (1,2) etc. Similarly the product s a * s b * s c is the sum of terms such as (p, q) (r, s) (t, u), formed by taking one term from each of s a, s b and s c, such that p, q, r, s, t, u are all different. The extension to higher order products is obvious. The associative law holds for the product operation so that the vertex sums may be multiplied successively in any order and/. is unique. If/ - # 0 each term in/. is formed by taking one
4 196 W. L. PRICE component (representing an edge) from each of the vertex sums, thus satisfying Condition 1. Furthermore the definition of the product operation ensures that, in each term of f E., no face index number appears more than once. Hence each face is associated with one, and only one, directed edge and Condition 2 is satisfied. It follows that the set of edges represented by the components of any term of/. form an H-tree in D such that E' is not a tree edge. Conversely, every H-tree having E' as a non-tree edge is uniquely described by a set of directed edges satisfying Conditions 1 and 2, and is therefore expressible as a term of/.. Thus/ E. represents the whole family of such H-trees and hence the algorithm generates the set {H E } in M Although the algorithm has been described in terms of the CP-dual, D, the generating function f E can be obtained directly from the CP-map, M, and the terms of f E interpreted as the H-circuits in M which include the edge E. The components of each term of f E now represent non-circuit edges i.e. if these are deleted from M the remaining edges form a Hamiltonian circuit through E. The procedure will be illustrated by means of a specific example. The CP-map, M ls is shown, together with its corresponding CP-dual, D u in Fig. 2. Vertices in M x (corresponding to faces in Dj) are arbitrarily assigned index numbers and faces in M x are arbitrarily assigned index letters. Suppose that the aim is to form the set {H E } where E is the edge linking vertices 1 and 12 in M x. Observe that E separates the faces g and h which correspond to root vertices in D x. First form the face sums of faces a, b, c, d, e, f. Thus * = [0,2) + (2, 3) + (3,4) + (4, 5) + (5, 1)], etc. Then s a *s b = [(1, 2)(3, 10) +(1, 2)(10, 11) + (2,3)(10, 11) + (4, 5)(2, 3)+ (4, 5)(3, 10)+ (4, 5)(10, 11)+ (4, 5)(11, 2) + (5, 1)(2, 3) + (5, 1)(3, 10) + (5, l)(10, ll) + (5, 1)(11, 2)]. The subsequent steps in forming the product function are straightforward and one finally obtains IE = s a * s b * s c * s d * s e * s f (2,3)(1,5)(8, 10)(4,9)(6, 7)(11,12) The first term in f E represents the H-circuit obtained by deleting the edges which join vertices 1 and 2, 3 and 10, 4 and 5, etc. in M x This circuit is shown in Fig. 3(e). Similarly the other terms of f E represent the other three members of {H E } shown in Figs. 3(g), 3(f) and 3(d). The operations involved in the determination of f E are readily expressible in the form of a computer programme. Hence, subject to the limitations of storage, the algorithm can be implemented on a digital computer. 12)].
5 THE HAMILTONIAN CIRCUITS OF A CUBIC PLANAR MAP The procedure is modified if the aim is to obtain {H}, the entire family of H-circuits. Clearly every member of {H} passes through two of the three edges incident at any vertex. Choose, any vertex, vertex 1 for example, and form the partial product function P = s b * s c * s d * s e * s f which excludes the terms s a, s g, s h corresponding to the three faces incident at vertex 1. Then P * s a generates the H-circuits which pass through edge E, separating g and //, as previously shown. Similarly P * s g generates the H-circuits which pass through the edge which separates a and h, and P s h generates the H-circuits which pass through the edge which separates a and g. Thus the function (s a +s g +s h )* P generates (twice) each member of {H}. Application of this procedure to M x results in the family of seven H-circuits shown in Fig Properties of the generating function 3.1. The generating function, f E, and its partial products possess a simple parity property. Consider the face sum, s, for any face of M. Let a k be the number of terms in s which contain the vertex number k and a kl be the number of terms which contain both k and /. It is evident from the definition of s that a k = 2 or 0 according as k is, or is not, a vertex on the boundary of the face which generates s. The value of a kl is 1 if A: and / are joined by an edge which bounds the face otherwise, a kl = 0. Let CJE be the number of terms in s which do not contain the index number k, and 0-fj be the number of terms which contain neither k nor /. Then o- E = S~a k and a m = S-a k -a l + a kl where S is the total number of terms in.y. Consider next a product t of any number of face sums Let t = s a *s b *s c... be defined for / in the same way as are defined for s. Now suppose that a new partial product t' is obtained by forming the product of t with some face sum s, giving t' = t * s. From the definition of the product operator, it follows that the number of terms in t' which contain some arbitrary index number p is given by where the summation ranges over all index numbers k except k = p. Hence V = I k where T is the total number of terms in t.
6 198 W. L. PRICE But therefore k V = a p r + T p S-2<yr p + 22 u pk x pk k Now, o k is even for all k. If it is assumed that x k is even for all k it follows that x p ' is even whatever the parity of a pk and x pk. Because p was chosen arbitrarily x k ' is even for all k. Hence, by induction, x k is even for any partial product and, in particular, for the complete generating function f E. An extension of the argument shows that, for any partial product, T fc> x klm> X klmnoi e * C - are all even (where x klm is the number of terms which contain all of A", / and m etc.) whereas may be either odd or even It has been shown that the number of terms in the generating function f E which contain any given index number, k, is even. But each term of f E contains every index number, hence f E always has an even number of terms. Therefore the total number of H-circuits which pass through any given edge of a CP-map is even The properties of the generating function, and its partial products, derived above depend only upon a simple property of the expression for the face sum and on the nature of the product operation. By taking into account the additional combinatorial constraints implied by the topological structure of a CP-map it seems possible that further properties of f E could be found. What are these properties? Do they yield the necessary and sufficient conditions that/ = 0 for some edge i.e. that the edge E is not contained in any H-circuit? What are the necessary and sufficient conditions that/ = 0 for every edge i.e. the CP-map is non-hamiltonian? Fig. 1. Directed edges of an H tree in
7 THE HAMILTONIAN CIRCUITS OF A CUBIC PLANAR MAP 199 E' (b) D, Fig. 2. Generation algorithm for M x
8 200 W. L. PRICE H-Circuits in A/ t Fig. 3. H-Trees in Di
9 THE HAMILTONIAN CIRCUITS OF A CUBIC PLANAR MAP 201 References 1. N. Christofides, Graph Theory An Algorithmic Approach (Academic Press, London, 1975). 2. G. H. Danielson, " On finding the simple paths and circuits in a graph ", IEEE Trans., CT-15 (1968), V. Dhawan, Hamiltonian circuits and related problems in graph theory, M.Sc. Report (Imperial College, London, 1969). 4. S. M. Roberts and B. Flores, " Systematic generation of Hamiltonian circuits ", Com. of ACM, 9 (1966), G. R. Selby, The use of topological methods in computer-aided circuit layout, Ph.D. Thesis (London University, 1970). 6. W. T. Tutte, "On Hamiltonian circuits", J. London Math. Soc, 21 (1946), S. S. Yau, " Generation of all Hamiltonian circuits, paths and centres of a graph and related problems ", IEEE Trans., CT-14 (1967), Engineering Department, University of Leicester, LEI 7RH.
Assignment 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 informationBasic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions
Basic Combinatorics Math 40210, Section 01 Fall 2012 Homework 4 Solutions 1.4.2 2: One possible implementation: Start with abcgfjiea From edge cd build, using previously unmarked edges: cdhlponminjkghc
More informationFundamental Properties of Graphs
Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,
More informationLecture 5: Graphs. Rajat Mittal. IIT Kanpur
Lecture : Graphs Rajat Mittal IIT Kanpur Combinatorial graphs provide a natural way to model connections between different objects. They are very useful in depicting communication networks, social networks
More informationEDGE MAXIMAL GRAPHS CONTAINING NO SPECIFIC WHEELS. Jordan Journal of Mathematics and Statistics (JJMS) 8(2), 2015, pp I.
EDGE MAXIMAL GRAPHS CONTAINING NO SPECIFIC WHEELS M.S.A. BATAINEH (1), M.M.M. JARADAT (2) AND A.M.M. JARADAT (3) A. Let k 4 be a positive integer. Let G(n; W k ) denote the class of graphs on n vertices
More informationGraph Theory. 1 Introduction to Graphs. Martin Stynes Department of Mathematics, UCC January 26, 2011
Graph Theory Martin Stynes Department of Mathematics, UCC email: m.stynes@ucc.ie January 26, 2011 1 Introduction to Graphs 1 A graph G = (V, E) is a non-empty set of nodes or vertices V and a (possibly
More informationScheduling, Map Coloring, and Graph Coloring
Scheduling, Map Coloring, and Graph Coloring Scheduling via Graph Coloring: Final Exam Example Suppose want to schedule some ;inal exams for CS courses with following course numbers: 1007, 3137, 3157,
More informationG.B. FAULKNER and D.H. YOUNGER
DISCRETE MATHEMATICS 7 (1974) 67-74. North-Holland Pubhshmg Company NON-HAMILTONIAN CUBIC PLANAR MAPS * G.B. FAULKNER and D.H. YOUNGER Unwerszty of Waterloo, Waterloo, Ont., Canada Received 9 April 1973
More informationFigure 2.1: A bipartite graph.
Matching problems The dance-class problem. A group of boys and girls, with just as many boys as girls, want to dance together; hence, they have to be matched in couples. Each boy prefers to dance with
More informationMatching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
More informationPebble Sets in Convex Polygons
2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon
More informationA THREE AND FIVE COLOR THEOREM
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 52, October 1975 A THREE AND FIVE COLOR THEOREM FRANK R. BERNHART1 ABSTRACT. Let / be a face of a plane graph G. The Three and Five Color Theorem
More informationGRAPHS WITH 1-FACTORS
proceedings of the american mathematical society Volume 42, Number 1, January 1974 GRAPHS WITH 1-FACTORS DAVID P. SUMNER Abstract. In this paper it is shown that if G is a connected graph of order 2n (n>
More informationGraph Theory. Part of Texas Counties.
Graph Theory Part of Texas Counties. We would like to visit each of the above counties, crossing each county only once, starting from Harris county. Is this possible? This problem can be modeled as a graph.
More information[8] that this cannot happen on the projective plane (cf. also [2]) and the results of Robertson, Seymour, and Thomas [5] on linkless embeddings of gra
Apex graphs with embeddings of face-width three Bojan Mohar Department of Mathematics University of Ljubljana Jadranska 19, 61111 Ljubljana Slovenia bojan.mohar@uni-lj.si Abstract Aa apex graph is a graph
More informationMatching Theory. Figure 1: Is this graph bipartite?
Matching Theory 1 Introduction A matching M of a graph is a subset of E such that no two edges in M share a vertex; edges which have this property are called independent edges. A matching M is said to
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 informationEvery planar graph is 4-colourable and 5-choosable a joint proof
Peter Dörre Fachhochschule Südwestfalen (University of Applied Sciences) Frauenstuhlweg, D-58644 Iserlohn, Germany doerre@fh-swf.de Mathematics Subject Classification: 05C5 Abstract A new straightforward
More informationPart II. Graph Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 53 Paper 3, Section II 15H Define the Ramsey numbers R(s, t) for integers s, t 2. Show that R(s, t) exists for all s,
More informationON THE STRONGLY REGULAR GRAPH OF PARAMETERS
ON THE STRONGLY REGULAR GRAPH OF PARAMETERS (99, 14, 1, 2) SUZY LOU AND MAX MURIN Abstract. In an attempt to find a strongly regular graph of parameters (99, 14, 1, 2) or to disprove its existence, we
More informationDischarging and reducible configurations
Discharging and reducible configurations Zdeněk Dvořák March 24, 2018 Suppose we want to show that graphs from some hereditary class G are k- colorable. Clearly, we can restrict our attention to graphs
More informationBar k-visibility Graphs
Bar k-visibility Graphs Alice M. Dean Department of Mathematics Skidmore College adean@skidmore.edu William Evans Department of Computer Science University of British Columbia will@cs.ubc.ca Ellen Gethner
More informationAdvanced Combinatorial Optimization September 17, Lecture 3. Sketch some results regarding ear-decompositions and factor-critical graphs.
18.438 Advanced Combinatorial Optimization September 17, 2009 Lecturer: Michel X. Goemans Lecture 3 Scribe: Aleksander Madry ( Based on notes by Robert Kleinberg and Dan Stratila.) In this lecture, we
More informationBasics of Graph Theory
Basics of Graph Theory 1 Basic notions A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Simple graphs have their
More informationPlanar graphs. Math Prof. Kindred - Lecture 16 Page 1
Planar graphs Typically a drawing of a graph is simply a notational shorthand or a more visual way to capture the structure of the graph. Now we focus on the drawings themselves. Definition A drawing of
More informationIntroduction to Graph Theory
Introduction to Graph Theory George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 351 George Voutsadakis (LSSU) Introduction to Graph Theory August 2018 1 /
More informationAN ALGORITHM FOR A MINIMUM COVER OF A GRAPH
AN ALGORITHM FOR A MINIMUM COVER OF A GRAPH ROBERT Z. NORMAN1 AND MICHAEL O. RABIN2 Introduction. This paper contains two similar theorems giving conditions for a minimum cover and a maximum matching of
More informationSarah Will Math 490 December 2, 2009
Sarah Will Math 490 December 2, 2009 Euler Circuits INTRODUCTION Euler wrote the first paper on graph theory. It was a study and proof that it was impossible to cross the seven bridges of Königsberg once
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 information(d) If the moon shares nothing and the sun does not share our works, then the earth is alive with creeping men.
Math 15 - Spring 17 Chapters 1 and 2 Test Solutions 1. Consider the declaratives statements, P : The moon shares nothing. Q: It is the sun that shares our works. R: The earth is alive with creeping men.
More informationPLANAR GRAPH BIPARTIZATION IN LINEAR TIME
PLANAR GRAPH BIPARTIZATION IN LINEAR TIME SAMUEL FIORINI, NADIA HARDY, BRUCE REED, AND ADRIAN VETTA Abstract. For each constant k, we present a linear time algorithm that, given a planar graph G, either
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 informationNOTICE WARNING CONCERNING COPYRIGHT RESTRICTIONS: The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or
NOTICE WARNING CONCERNING COPYRIGHT RESTRICTIONS: The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or other reproductions of copyrighted material. Any copying
More informationDiscrete Wiskunde II. Lecture 6: Planar Graphs
, 2009 Lecture 6: Planar Graphs University of Twente m.uetz@utwente.nl wwwhome.math.utwente.nl/~uetzm/dw/ Planar Graphs Given an undirected graph (or multigraph) G = (V, E). A planar embedding of G is
More informationProblem Set 3. MATH 776, Fall 2009, Mohr. November 30, 2009
Problem Set 3 MATH 776, Fall 009, Mohr November 30, 009 1 Problem Proposition 1.1. Adding a new edge to a maximal planar graph of order at least 6 always produces both a T K 5 and a T K 3,3 subgraph. Proof.
More informationMath 443/543 Graph Theory Notes
Math 443/543 Graph Theory Notes David Glickenstein September 3, 2008 1 Introduction We will begin by considering several problems which may be solved using graphs, directed graphs (digraphs), and networks.
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 informationTWO CONTRIBUTIONS OF EULER
TWO CONTRIBUTIONS OF EULER SIEMION FAJTLOWICZ. MATH 4315 Eulerian Tours. Although some mathematical problems which now can be thought of as graph-theoretical, go back to the times of Euclid, the invention
More informationOn the Greedoid Polynomial for Rooted Graphs and Rooted Digraphs
On the Greedoid Polynomial for Rooted Graphs and Rooted Digraphs Elizabeth W. McMahon LAFAYETTE COLLEGE EASTON, PENNSYLVANIA ABSTRACT We examine some properties of the 2-variable greedoid polynomial f(g;t,
More informationOn Covering a Graph Optimally with Induced Subgraphs
On Covering a Graph Optimally with Induced Subgraphs Shripad Thite April 1, 006 Abstract We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number
More informationCPS 102: Discrete Mathematics. Quiz 3 Date: Wednesday November 30, Instructor: Bruce Maggs NAME: Prob # Score. Total 60
CPS 102: Discrete Mathematics Instructor: Bruce Maggs Quiz 3 Date: Wednesday November 30, 2011 NAME: Prob # Score Max Score 1 10 2 10 3 10 4 10 5 10 6 10 Total 60 1 Problem 1 [10 points] Find a minimum-cost
More informationDHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI
DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI Department of Computer Science and Engineering CS6702 - GRAPH THEORY AND APPLICATIONS Anna University 2 & 16 Mark Questions & Answers Year / Semester: IV /
More informationarxiv: v4 [math.co] 25 Apr 2010
QUIVERS OF FINITE MUTATION TYPE AND SKEW-SYMMETRIC MATRICES arxiv:0905.3613v4 [math.co] 25 Apr 2010 AHMET I. SEVEN Abstract. Quivers of finite mutation type are certain directed graphs that first arised
More informationAn Introduction to Graph Theory
An Introduction to Graph Theory Evelyne Smith-Roberge University of Waterloo March 22, 2017 What is a graph? Definition A graph G is: a set V (G) of objects called vertices together with: a set E(G), of
More informationGraph Theory Questions from Past Papers
Graph Theory Questions from Past Papers Bilkent University, Laurence Barker, 19 October 2017 Do not forget to justify your answers in terms which could be understood by people who know the background theory
More informationCrossing bridges. Crossing bridges Great Ideas in Theoretical Computer Science. Lecture 12: Graphs I: The Basics. Königsberg (Prussia)
15-251 Great Ideas in Theoretical Computer Science Lecture 12: Graphs I: The Basics February 22nd, 2018 Crossing bridges Königsberg (Prussia) Now Kaliningrad (Russia) Is there a way to walk through the
More informationBipartite Roots of Graphs
Bipartite Roots of Graphs Lap Chi Lau Department of Computer Science University of Toronto Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only
More informationMath 443/543 Graph Theory Notes 2: Transportation problems
Math 443/543 Graph Theory Notes 2: Transportation problems David Glickenstein September 15, 2014 1 Readings This is based on Chartrand Chapter 3 and Bondy-Murty 18.1, 18.3 (part on Closure of a Graph).
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 informationPantographic polygons
203 Pantographic polygons John Miller and Emanuel Strzelecki Abstract Necessary and sufficient conditions are given for a polygon to be pantographic. The property is held by all regular polygons and by
More informationPlanar Graphs with Many Perfect Matchings and Forests
Planar Graphs with Many Perfect Matchings and Forests Michael Biro Abstract We determine the number of perfect matchings and forests in a family T r,3 of triangulated prism graphs. These results show that
More information(Received Judy 13, 1971) (devised Nov. 12, 1971)
J. Math. Vol. 25, Soc. Japan No. 1, 1973 Minimal 2-regular digraphs with given girth By Mehdi BEHZAD (Received Judy 13, 1971) (devised Nov. 12, 1971) 1. Abstract. A digraph D is r-regular if degree v =
More informationAn Introduction to Graph Theory
An Introduction to Graph Theory CIS008-2 Logic and Foundations of Mathematics David Goodwin david.goodwin@perisic.com 12:00, Friday 17 th February 2012 Outline 1 Graphs 2 Paths and cycles 3 Graphs and
More informationExercise set 2 Solutions
Exercise set 2 Solutions Let H and H be the two components of T e and let F E(T ) consist of the edges of T with one endpoint in V (H), the other in V (H ) Since T is connected, F Furthermore, since T
More informationSCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. An Introduction to Graph Theory
SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mathematics An Introduction to Graph Theory. Introduction. Definitions.. Vertices and Edges... The Handshaking Lemma.. Connected Graphs... Cut-Points and Bridges.
More informationCharacterizations of graph classes by forbidden configurations
Characterizations of graph classes by forbidden configurations Zdeněk Dvořák September 14, 2015 We consider graph classes that can be described by excluding some fixed configurations. Let us give some
More information11.4 Bipartite Multigraphs
11.4 Bipartite Multigraphs Introduction Definition A graph G is bipartite if we can partition the vertices into two disjoint subsets U and V such that every edge of G has one incident vertex in U and the
More informationMC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points
MC 0 GRAPH THEORY 0// Solutions to HW # 0 points + XC points ) [CH] p.,..7. This problem introduces an important class of graphs called the hypercubes or k-cubes, Q, Q, Q, etc. I suggest that before you
More informationThree applications of Euler s formula. Chapter 10
Three applications of Euler s formula Chapter 10 A graph is planar if it can be drawn in the plane R without crossing edges (or, equivalently, on the -dimensional sphere S ). We talk of a plane graph if
More informationLecture 8: The Traveling Salesman Problem
Lecture 8: The Traveling Salesman Problem Let G = (V, E) be an undirected graph. A Hamiltonian cycle of G is a cycle that visits every vertex v V exactly once. Instead of Hamiltonian cycle, we sometimes
More informationStar coloring planar graphs from small lists
Star coloring planar graphs from small lists André Kündgen Craig Timmons June 4, 2008 Abstract A star coloring of a graph is a proper vertex-coloring such that no path on four vertices is 2-colored. We
More informationMath 443/543 Graph Theory Notes
Math 443/543 Graph Theory Notes David Glickenstein September 8, 2014 1 Introduction We will begin by considering several problems which may be solved using graphs, directed graphs (digraphs), and networks.
More informationConnecting face hitting sets in planar graphs
Connecting face hitting sets in planar graphs Pascal Schweitzer and Patrick Schweitzer Max-Planck-Institute for Computer Science Campus E1 4, D-66123 Saarbrücken, Germany pascal@mpi-inf.mpg.de University
More informationHW Graph Theory SOLUTIONS (hbovik)
Diestel 1.3: Let G be a graph containing a cycle C, and assume that G contains a path P of length at least k between two vertices of C. Show that G contains a cycle of length at least k. If C has length
More informationMonotone Paths in Geometric Triangulations
Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation
More informationand Heinz-Jürgen Voss
Discussiones Mathematicae Graph Theory 22 (2002 ) 193 198 ON k-trestles IN POLYHEDRAL GRAPHS Michal Tkáč Department of Mathematics The Faculty of Business Economics in Košice University of Economics in
More informationARTICLE IN PRESS. An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
S0020-0190(04)00098-5/SCO AID:3078 Vol. ( ) P.1 (1-7) ELSGMLTM(IPL):m3 v 1.193 Prn:15/04/2004; 13:20 ipl3078 by:r.m. p. 1 Information Processing Letters ( ) www.elsevier.com/locate/ipl An anonymous self-stabilizing
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 informationA TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3
A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 ANDREW J. HANSON AND JI-PING SHA In this paper we present a systematic and explicit algorithm for tessellating the algebraic surfaces (real 4-manifolds) F
More informationK 4,4 e Has No Finite Planar Cover
K 4,4 e Has No Finite Planar Cover Petr Hliněný Dept. of Applied Mathematics, Charles University, Malostr. nám. 25, 118 00 Praha 1, Czech republic (E-mail: hlineny@kam.ms.mff.cuni.cz) February 9, 2005
More informationA Reduction of Conway s Thrackle Conjecture
A Reduction of Conway s Thrackle Conjecture Wei Li, Karen Daniels, and Konstantin Rybnikov Department of Computer Science and Department of Mathematical Sciences University of Massachusetts, Lowell 01854
More informationVertex Colorings without Rainbow or Monochromatic Subgraphs. 1 Introduction
Vertex Colorings without Rainbow or Monochromatic Subgraphs Wayne Goddard and Honghai Xu Dept of Mathematical Sciences, Clemson University Clemson SC 29634 {goddard,honghax}@clemson.edu Abstract. This
More informationModule 7. Independent sets, coverings. and matchings. Contents
Module 7 Independent sets, coverings Contents and matchings 7.1 Introduction.......................... 152 7.2 Independent sets and coverings: basic equations..... 152 7.3 Matchings in bipartite graphs................
More informationCS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS
CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1. Define Graph. A graph G = (V, E) consists
More informationVertex-Colouring Edge-Weightings
Vertex-Colouring Edge-Weightings L. Addario-Berry a, K. Dalal a, C. McDiarmid b, B. A. Reed a and A. Thomason c a School of Computer Science, McGill University, University St. Montreal, QC, H3A A7, Canada
More informationForced orientation of graphs
Forced orientation of graphs Babak Farzad Mohammad Mahdian Ebad S. Mahmoodian Amin Saberi Bardia Sadri Abstract The concept of forced orientation of graphs was introduced by G. Chartrand et al. in 1994.
More informationLet v be a vertex primed by v i (s). Then the number f(v) of neighbours of v which have
Let v be a vertex primed by v i (s). Then the number f(v) of neighbours of v which have been red in the sequence up to and including v i (s) is deg(v)? s(v), and by the induction hypothesis this sequence
More informationRevisiting the bijection between planar maps and well labeled trees
Revisiting the bijection between planar maps and well labeled trees Daniel Cosmin Porumbel September 1, 2014 Abstract The bijection between planar graphs and well labeled trees was published by Cori and
More informationv V Question: How many edges are there in a graph with 10 vertices each of degree 6?
ECS20 Handout Graphs and Trees March 4, 2015 (updated 3/9) Notion of a graph 1. A graph G = (V,E) consists of V, a nonempty set of vertices (or nodes) and E, a set of pairs of elements of V called edges.
More informationProject and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi
Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi Lecture - 8 Consistency and Redundancy in Project networks In today s lecture
More informationTheorem 2.9: nearest addition algorithm
There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used
More informationWUCT121. Discrete Mathematics. Graphs
WUCT121 Discrete Mathematics Graphs WUCT121 Graphs 1 Section 1. Graphs 1.1. Introduction Graphs are used in many fields that require analysis of routes between locations. These areas include communications,
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 informationAnswers to specimen paper questions. Most of the answers below go into rather more detail than is really needed. Please let me know of any mistakes.
Answers to specimen paper questions Most of the answers below go into rather more detail than is really needed. Please let me know of any mistakes. Question 1. (a) The degree of a vertex x is the number
More informationChain Packings and Odd Subtree Packings. Garth Isaak Department of Mathematics and Computer Science Dartmouth College, Hanover, NH
Chain Packings and Odd Subtree Packings Garth Isaak Department of Mathematics and Computer Science Dartmouth College, Hanover, NH 1992 Abstract A chain packing H in a graph is a subgraph satisfying given
More informationThe Game of Criss-Cross
Chapter 5 The Game of Criss-Cross Euler Characteristic ( ) Overview. The regions on a map and the faces of a cube both illustrate a very natural sort of situation: they are each examples of regions that
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 informationDefinition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1
Graph fundamentals Bipartite graph characterization Lemma. If a graph contains an odd closed walk, then it contains an odd cycle. Proof strategy: Consider a shortest closed odd walk W. If W is not a cycle,
More informationCHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism
CHAPTER 2 Graphs 1. Introduction to Graphs and Graph Isomorphism 1.1. The Graph Menagerie. Definition 1.1.1. A simple graph G = (V, E) consists of a set V of vertices and a set E of edges, represented
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 informationMATH 890 HOMEWORK 2 DAVID MEREDITH
MATH 890 HOMEWORK 2 DAVID MEREDITH (1) Suppose P and Q are polyhedra. Then P Q is a polyhedron. Moreover if P and Q are polytopes then P Q is a polytope. The facets of P Q are either F Q where F is a facet
More informationMAT 145: PROBLEM SET 4
MAT 145: PROBLEM SET 4 DUE TO FRIDAY FEB 22 Abstract. This problem set corresponds to the sixth week of the Combinatorics Course in the Winter Quarter 2019. It was posted online on Friday Feb 15 and is
More informationMaximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded Cemil Dibek Tınaz Ekim Pinar Heggernes Abstract We determine the maximum number of edges that a claw-free
More informationDiscrete Applied Mathematics. A revision and extension of results on 4-regular, 4-connected, claw-free graphs
Discrete Applied Mathematics 159 (2011) 1225 1230 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam A revision and extension of results
More informationBar k-visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness
Bar k-visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness Alice M. Dean, William Evans, Ellen Gethner 3,JoshuaD.Laison, Mohammad Ali Safari 5, and William T. Trotter 6 Department
More informationGraph and Digraph Glossary
1 of 15 31.1.2004 14:45 Graph and Digraph Glossary A B C D E F G H I-J K L M N O P-Q R S T U V W-Z Acyclic Graph A graph is acyclic if it contains no cycles. Adjacency Matrix A 0-1 square matrix whose
More informationGraphs and networks Mixed exercise
Graphs and networks Mixed exercise E.g. 2 a, e and h are isomorphic. b and i are isomorphic. c and g are isomorphic. d and f are isomorphic. 3 a b i ii iii Pearson Education Ltd 208. Copying permitted
More informationSolution of the Heawood Map-Coloring Problem--Case 8 GERHARD RINGEL AND J. W. T. YOUNGS*
JOURNAL OF COMBINATORIAL THEORY 7, 33-363 (1969) Solution of the Heawood Map-Coloring Problem--Case 8 GERHARD RINGEL AND J. W. T. YOUNGS* Free University of Berlin, Berlin, Germany, and University of California,
More informationMath 485, Graph Theory: Homework #3
Math 485, Graph Theory: Homework #3 Stephen G Simpson Due Monday, October 26, 2009 The assignment consists of Exercises 2129, 2135, 2137, 2218, 238, 2310, 2313, 2314, 2315 in the West textbook, plus the
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 information