Rigidity of Graphs and Frameworks
|
|
- Delilah Coleen Daniels
- 5 years ago
- Views:
Transcription
1 Rigidity of Graphs and Frameworks Rigid Frameworks The Rigidity Matrix and the Rigidity Matroid Infinitesimally Rigid Frameworks Rigid Graphs Rigidity in R d, d = 1,2 Global Rigidity in R d, d = 1,2 1 Rigidity of Graphs and Frameworks
2 Frameworks in R d A framework in R d is a pair (G, p), where G = (V,E) is a graph and p is a map from V to R d. We consider the framework to be a straight line embedding of G in R d in which the length of an edge uv E is given by the Euclidean distance between the points p(u) and p(v). We say that (G, p) is a realisation of G in R d. 2 Rigidity of Graphs and Frameworks
3 Rigid Frameworks Let (G, p) and (G,q) be frameworks. Then: (G, p) and (G,q) are equivalent if they have the same edge lengths. (G, p) and (G,q) are congruent if p(u) p(v) = q(u) q(v) for all u,v V. (G, p) is rigid if there exists an ε > 0 such that every framework (G,q) which is equivalent to (G, p) and satisfies p(v) q(v) < ε for all v V, is congruent to (G, p). (This is equivalent to saying that there is no smooth deformation of (G, p) which preserves the lengths of all its edges.) (G, p) is globally rigid if every framework (G,q) which is equivalent to (G, p), is congruent to (G, p). 3 Rigidity of Graphs and Frameworks
4 The Rigidity Matrix and the Rigidity Matroid Let G = (V,E) be a graph and d be a positive integer. We associate a d-dimensional vector of distinct variables v with each v V. The d-dimensional rigidity matrix M G of G is the E d V matrix with rows indexed by E and columns indexed by the variables in v, v V, in which the entry in row e and columns v is: v w if e = vw is incident with v 0 if e is not incident with v. The rigidity matroid M(G) = (E,r) of G is the row matroid of M G. 4 Rigidity of Graphs and Frameworks
5 Example M G = v 1 v 2 v 2 v v 2 v 3 v 3 v v 3 v 4 v 4 v 3 v 1 v v 4 v 1 0 v 2 v 4 0 v 4 v 2 d = 1, v i = (x i ). M G = x 1 x 2 x 2 x x 2 x 3 x 3 x x 3 x 4 x 4 x 3 x 1 x x 4 x 1 0 x 2 x 4 0 x 4 x 2 M(G) is the cycle matroid of G, r(e) = 3.
6 d = 2, v i = (x i,y i ). M G = x 1 x 2 y 1 y 2 x 2 x 1 y 2 y x 2 x 3 y 2 y 3 x 3 x 2 y 3 y x 3 x 4 y 3 y 4 x 4 x 3 y 4 x 1 x 4 y 1 y x 4 x 1 y x 2 x 4 y 2 y x 4 x 2 y 4 M(G) = U 5,5, r(e) = 5.
7 The rigidity matrix of a framework (G, p) is the matrix M G,p obtained from M G by replacing v by p(v) for all v V. The rigidity matroid of (G, p), M(G, p), is the row matroid of M G,p. We say that (G, p) is a generic realization of G if M(G, p) = M(G). (This occurs, in particular, when the co-ordinates of all the points p(v), v V, are algebraically independent over Q.) 7 Rigidity of Graphs and Frameworks
8 Infinitesimally Rigid Frameworks Let { nd ( ) d+1 S(n,d) = 2 if n d + 1 ( n 2) if n d + 1 Lemma 1 Let (G, p) be a framework in R d. Then rankm G,p rankm G S(n,d). Furthermore, if rankm G,p = S(n,d), then (G, p) is rigid. We say that (G, p) is infinitesimally rigid if rankm G,p = S(n,d). Thus (G, p) is infinitesimally rigid (G, p) is rigid 8 Rigidity of Graphs and Frameworks
9 When (G, p) is a generic realisation of G: (G, p) is rigid (G, p) is infinitesimally rigid
10 Rigid Graphs A graph G is rigid in R d if rankm G = S(n,d). Lemma 2 The following statements are equivalent. G is rigid in R d. r(e) = S(n,d) in M(G). some framework (G, p) in R d is infinitesimally rigid. every generic framework (G, p) in R d is rigid. the set of all frameworks (G, p) which are rigid in R d is a dense subset of R nd. 10 Rigidity of Graphs and Frameworks
11 Minimally Rigid Graphs A graph G is minimally rigid in R d if G is rigid and G e is not rigid for all e E. Lemma 3 The following statements are equivalent. G is minimally rigid in R d. G is rigid and E = S(n,d). G is rigid and E is independent in M(G). 11 Rigidity of Graphs and Frameworks
12 Rigidity in R We have S(n,1) = n 1. M(G) is just the cycle matroid of G. A set of edges E is independent in M(G) if and only if E induces a forest in G. G is rigid if and only if G is connected. G is minimally rigid if and only if G is a tree. (G, p) is a generic realization of G for all embeddings p (in which adjacent vertices are mapped to distinct points). 12 Rigidity of Graphs and Frameworks
13 Rigidity in R 2 We have S(n,2) = 2n 3 if n 2. For X V let E(X) denote the set, and i(x) the number, of edges of G induced by X. Theorem 4 (Laman, 1970) Let G = (V,E) be a graph. Then E is independent in M(G) if and only if i(x) 2 X 3 for all X V with X Rigidity of Graphs and Frameworks
14 Theorem 5 (Lovasz and Yemini, 1982) Let G = (V,E) be a graph. Then r(e) = min{ t i=1 (2 X i 3)} where the minimum is taken over all collections of subsets {X 1,X 2,...,X t } of G such that {E(X 1 ),E(X 2 ),...,E(X t )} partitions E. A rigid component of G is a maximal rigid subgraph of G. If H 1,H 2,...,H t are the rigid components of G and X i = V (H i ) then X i X j 1 for all 1 i < j t and r(e) = t i=1(2 X i 3). 14 Rigidity of Graphs and Frameworks
15 A 0-extension of G is obtained by adding a new vertex v and joining v to two vertices of G. Suppose x,y,z V and xy E. A 1-extension of G is obtained by adding a new vertex v, joining v to x,y,z and deleting the edge xy. Theorem 6 (Henneberg, 1911) If G is minimally rigid then any 0-extension or 1-extension of G is minimally rigid. Conversely, if H is minimally rigid and V (H) 3, then H is a 0-extension or 1-extension of a minimally rigid graph G. Corollary 7 G is minimally rigid if and only if G can be obtained from K 2 by a sequence of 0-extensions and 1-extensions. 15 Rigidity of Graphs and Frameworks
16 Global Rigidity A framework (G, p) is algebraically independent if the set of all co-ordinates of all points p(v), v V, is algebraically independent over Q. Theorem 8 (Hendrickson, 1992) Suppose (G, p) is an algebraically independent realization of G in R d. If (G, p) is globally rigid then either G is a complete graph with at most d + 1 vertices, or the following two conditions hold: (a) G is (d + 1)-connected, and (b) G e is rigid in R d for all e E. We say that G is redundantly rigid in R d if G e is rigid in R d for all e E. 16 Rigidity of Graphs and Frameworks
17 Theorem 9 (Connelly, 1989 and 2003) Suppose G is a 1-extension of H. Let (G, p) be an algebraically independent realization of G in R 2. If (H, p V (H) ) is globally rigid, then (G, p) is globally rigid. Theorem 10 (Jordán and BJ, 2003) Let G = (V,E) be a graph. Then G is 3-connected and redundantly rigid in R 2 if and only if G can be obtained from K 4 by the operations of adding edges and performing 1-extensions. Theorem 11 (Jordán and BJ, Connelly, 2003) Let (G, p) be an algebraically independent realization of G in R 2. Then (G, p) is globally rigid if and only if either G = K 2,K 3, or the following two conditions hold: (a) G is 3 connected, and (b) G is redundantly rigid in R Rigidity of Graphs and Frameworks
Rigidity of Graphs and Frameworks
School of Mathematical Sciences Queen Mary, University of London England DIMACS, 26-29 July, 2016 Bar-and-Joint Frameworks A d-dimensional bar-and-joint framework is a pair (G, p), where G = (V, E) is
More informationNotes on the Rigidity of Graphs
Notes on the Rigidity of Graphs Bill Jackson Levico, 22-26 October 2007 1 Introduction The first reference to the rigidity of frameworks in the mathematical literature occurs in a problem posed by Euler
More informationThe number of complex realisations of a rigid graph
The number of complex realisations of a rigid graphs Bill Jackson School of Mathematical Sciences Queen Mary, University of London, England and John C. Owen Siemans, Cambridge, England. Workshop on Rigidity
More informationThe number of equivalent realisations of a rigid graph
arxiv:1204.1228v2 [math.co] 6 Oct 2016 The number of equivalent realisations of a rigid graph Bill Jackson J.C. Owen August 2, 2018 Abstract Given a rigid realisation of a graph G in R 2, it is an open
More informationThe number of equivalent realisations of a rigid graph
The number of equivalent realisations of a rigid graph Bill Jackson J.C. Owen 3 April, 2012 Abstract Given a generic rigid realisation of a graph in R 2, it is an open problem to determine the maximum
More informationPacking of Rigid Spanning Subgraphs and Spanning Trees
Packing of Rigid Spanning Subgraphs and Spanning Trees Joseph Cheriyan Olivier Durand de Gevigney Zoltán Szigeti December 14, 2011 Abstract We prove that every 6k + 2l, 2k-connected simple graph contains
More informationCombinatorial Rigidity and the Molecular Conjecture
Page 1 of 65 Combinatorial Rigidity and the Molecular Conjecture Brigitte Servatius Worcester Polytechnic Institute The Proof of the Product Rule To derivate a product as defined The diff rence quotient
More information15.1 Matching, Components, and Edge cover (Collaborate with Xin Yu)
15.1 Matching, Components, and Edge cover (Collaborate with Xin Yu) First show l = c by proving l c and c l. For a maximum matching M in G, let V be the set of vertices covered by M. Since any vertex in
More informationGeometric Constraints II
Geometric Constraints II Realizability, Rigidity and Related theorems. Embeddability of Metric Spaces Section 1 Given the matrix D d i,j 1 i,j n corresponding to a metric space, give conditions under which
More informationRigidity of Skeletal Structures
CHAPTER 3 Rigidity of Skeletal Structures 3. INTRODUCTION The rigidity of structures has been studied by pioneering structural engineers such as Henneberg [79] and Müller-Breslau [76]. The methods they
More informationRigidity matroids and inductive constructions of graphs and hypergraphs
Rigidity matroids and inductive constructions of graphs and hypergraphs Viktória E. Kaszanitzky Supervisor: Tibor Jordán, Professor, Doctor of Sciences Doctoral School: Mathematics Director: Miklós Laczkovich,
More informationBrigitte Servatius and Herman Servatius. Department of Mathematics Syracuse University Syracuse NY,
GENERIC AND ABSTRACT RIGIDITY Brigitte Servatius and Herman Servatius Department of Mathematics Syracuse University Syracuse NY, 13244-1150 Rigidity We are all familiar with frameworks of rods attached
More informationA note on [k, l]-sparse graphs
Egerváry Research Group on Combinatorial Optimization Technical reports TR-2005-05. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More informationRing Sums, Bridges and Fundamental Sets
1 Ring Sums Definition 1 Given two graphs G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) we define the ring sum G 1 G 2 = (V 1 V 2, (E 1 E 2 ) (E 1 E 2 )) with isolated points dropped. So an edge is in G 1 G
More informationarxiv: v1 [math.co] 5 Dec 2016
Global Rigidity of Periodic Graphs under Fixed-lattice Representations Viktória E. Kaszanitzky Bernd Schulze Shin-ichi Tanigawa arxiv:1612.01379v1 [math.co] 5 Dec 2016 November 19, 2018 Abstract In [8]
More informationSymmetric versions of Laman s Theorem
Symmetric versions of Laman s Theorem arxiv:0907.1958v1 [math.mg] 11 Jul 2009 Bernd Schulze Inst. Mathematics, MA 6-2 TU Berlin D-10623 Berlin, Germany October 21, 2017 Abstract Recent work has shown that
More informationGUOLI DING AND STAN DZIOBIAK. 1. Introduction
-CONNECTED GRAPHS OF PATH-WIDTH AT MOST THREE GUOLI DING AND STAN DZIOBIAK Abstract. It is known that the list of excluded minors for the minor-closed class of graphs of path-width numbers in the millions.
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)
More informationON GLOBAL DOMINATING-χ-COLORING OF GRAPHS
- TAMKANG JOURNAL OF MATHEMATICS Volume 48, Number 2, 149-157, June 2017 doi:10.5556/j.tkjm.48.2017.2295 This paper is available online at http://journals.math.tku.edu.tw/index.php/tkjm/pages/view/onlinefirst
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H 1, H 2 ) so that H 1 H 2 = G E(H 1 ) E(H 2 ) = V (H 1 ) V (H 2 ) = k Such a separation is proper if V (H
More informationBinomial Ideals from Graphs
Binomial Ideals from Graphs Danielle Farrar University of Washington Yolanda Manzano St. Mary s University Juan Manuel Torres-Acevedo University of Puerto Rico Humacao August 10, 2000 Abstract This paper
More information1 Some loose ends from last time
Cornell University, Fall 2010 CS 6820: Algorithms Lecture notes: Kruskal s and Borůvka s MST algorithms September 20, 2010 1 Some loose ends from last time 1.1 A lemma concerning greedy algorithms and
More informationTrees. A tree is a graph which is. (a) Connected and. (b) has no cycles (acyclic).
Trees A tree is a graph which is (a) Connected and (b) has no cycles (acyclic). 1 Lemma 1 Let the components of G be C 1, C 2,..., C r, Suppose e = (u, v) / E, u C i, v C j. (a) i = j ω(g + e) = ω(g).
More informationMatroids. Start with a set of objects, for example: E={ 1, 2, 3, 4, 5 }
Start with a set of objects, for example: E={ 1, 2, 3, 4, 5 } Start with a set of objects, for example: E={ 1, 2, 3, 4, 5 } The power set of E is the set of all possible subsets of E: {}, {1}, {2}, {3},
More informationA short course on matching theory, ECNU Shanghai, July 2011.
A short course on matching theory, ECNU Shanghai, July 2011. Sergey Norin LECTURE 3 Tight cuts, bricks and braces. 3.1. Outline of Lecture Ear decomposition of bipartite graphs. Tight cut decomposition.
More informationEvery 3-connected, essentially 11-connected line graph is hamiltonian
Every 3-connected, essentially 11-connected line graph is hamiltonian Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou October 2, 25 Abstract Thomassen conjectured that every 4-connected line graph is hamiltonian.
More informationUsing Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems
Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems Jan van den Heuvel and Snežana Pejić Department of Mathematics London School of Economics Houghton Street,
More informationThe Matrix-Tree Theorem
The Matrix-Tree Theorem Christopher Eur March 22, 2015 Abstract: We give a brief introduction to graph theory in light of linear algebra. Our results culminates in the proof of Matrix-Tree Theorem. 1 Preliminaries
More informationAunu Integer Sequence as Non-Associative Structure and Their Graph Theoretic Properties
Advances in Pure Mathematics, 2016, 6, 409-419 Published Online May 2016 in SciRes. http://www.scirp.org/journal/apm http://dx.doi.org/10.4236/apm.2016.66028 Aunu Integer Sequence as Non-Associative Structure
More informationGraph invariants in the spin model
Graph invariants in the spin model Alexander Schrijver 1 Abstract. Given a symmetric n n matrix A, we define, for any graph G, f A (G) := a φ(u),φ(v). φ:v G {1,...,n} uv EG We characterize for which graph
More informationCounting d.o.f.s in periodic frameworks. Louis Theran (Aalto University / AScI, CS)
Counting d.o.f.s in periodic frameworks Louis Theran (Aalto University / AScI, CS) Frameworks Graph G = (V,E); edge lengths l(ij); ambient dimension d Length eqns. pi - pj 2 = l(ij) 2 The p s are a placement
More informationSome Results on Paths and Cycles in Claw-Free Graphs
Some Results on Paths and Cycles in Claw-Free Graphs BING WEI Department of Mathematics University of Mississippi 1 1. Basic Concepts A graph G is called claw-free if it has no induced subgraph isomorphic
More informationNon-Recursively Constructible Recursive Families of Graphs
Non-Recursively Constructible Recursive Families of Graphs Colleen Bouey Department of Mathematics Loyola Marymount College Los Angeles, CA 90045, USA cbouey@lion.lmu.edu Aaron Ostrander Dept of Math and
More informationGeometry of Configuration Spaces of Tensegrities
Discrete Comput Geom (010) 43: 436 466 DOI 10.1007/s00454-009-99-4 Geometry of Configuration Spaces of Tensegrities Franck Doray Oleg Karpenkov Jan Schepers Received: 0 June 008 / Revised: 6 February 009
More informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
More informationMatrix Completion Problems for Pairs of Related Classes of Matrices
Matrix Completion Problems for Pairs of Related Classes of Matrices Leslie Hogben Department of Mathematics Iowa State University Ames, IA 50011 lhogben@iastate.edu Abstract For a class X of real matrices,
More information5 Flows and cuts in digraphs
5 Flows and cuts in digraphs Recall that a digraph or network is a pair G = (V, E) where V is a set and E is a multiset of ordered pairs of elements of V, which we refer to as arcs. Note that two vertices
More information4 Packing T-joins and T-cuts
4 Packing T-joins and T-cuts Introduction Graft: A graft consists of a connected graph G = (V, E) with a distinguished subset T V where T is even. T-cut: A T -cut of G is an edge-cut C which separates
More informationMaps of matroids with applications
Discrete Mathematics 303 (2005) 75 85 www.elsevier.com/locate/disc Maps of matroids with applications András Recski a,b, a Department of Computer Science and Information Theory, Budapest University of
More informationFORBIDDEN MINORS FOR THE CLASS OF GRAPHS G WITH ξ(g) 2. July 25, 2006
FORBIDDEN MINORS FOR THE CLASS OF GRAPHS G WITH ξ(g) 2 LESLIE HOGBEN AND HEIN VAN DER HOLST July 25, 2006 Abstract. For a given simple graph G, S(G) is defined to be the set of real symmetric matrices
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More informationThe Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
More informationThe Strong Largeur d Arborescence
The Strong Largeur d Arborescence Rik Steenkamp (5887321) November 12, 2013 Master Thesis Supervisor: prof.dr. Monique Laurent Local Supervisor: prof.dr. Alexander Schrijver KdV Institute for Mathematics
More informationAn Introduction to the Rigidity Theory of Bar and Joint Frameworks
An Introduction to the Rigidity Theory of Bar and Joint Frameworks James Cruickshank NUI Galway April 11, 2013 Frameworks An n-dimensional (abstract) bar and joint framework is a pair (G, ρ) where G =
More informationTope Graph of Oriented Matroids
Tope Graph of Oriented Matroids Clara Brioschi, Legi: 12-946-554 1 st December 2013 1 Introduction and Definitions In this report I will first define tope graphs of oriented matroids and their geometric
More informationThe Maximum Likelihood Threshold of a Graph
The Maximum Likelihood Threshold of a Graph Elizabeth Gross and Seth Sullivant San Jose State University, North Carolina State University August 28, 2014 Seth Sullivant (NCSU) Maximum Likelihood Threshold
More informationOn minors of the compound matrix of a Laplacian
On minors of the compound matrix of a Laplacian R. B. Bapat 1 Indian Statistical Institute New Delhi, 110016, India e-mail: rbb@isid.ac.in August 28, 2013 Abstract: Let L be an n n matrix with zero row
More informationImprimitive symmetric graphs with cyclic blocks
Imprimitive symmetric graphs with cyclic blocks Sanming Zhou Department of Mathematics and Statistics University of Melbourne Joint work with Cai Heng Li and Cheryl E. Praeger December 17, 2008 Outline
More informationALGEBRAIC MATCHING THEORY. C. D. Godsil 1
ALGEBRAIC MATCHING THEORY C. D. Godsil 1 Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario Canada N2L 3G1 chris@bilby.uwaterloo.ca Submitted: July 6, 1994; Accepted:
More informationDouble domination edge removal critical graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 48 (2010), Pages 285 299 Double domination edge removal critical graphs Soufiane Khelifi Laboratoire LMP2M, Bloc des laboratoires Université demédéa Quartier
More informationInduced Saturation of Graphs
Induced Saturation of Graphs Maria Axenovich a and Mónika Csikós a a Institute of Algebra and Geometry, Karlsruhe Institute of Technology, Englerstraße 2, 76128 Karlsruhe, Germany Abstract A graph G is
More informationConstructive proof of deficiency theorem of (g, f)-factor
SCIENCE CHINA Mathematics. ARTICLES. doi: 10.1007/s11425-010-0079-6 Constructive proof of deficiency theorem of (g, f)-factor LU HongLiang 1, & YU QingLin 2 1 Center for Combinatorics, LPMC, Nankai University,
More informationRamsey Theory. May 24, 2015
Ramsey Theory May 24, 2015 1 König s Lemma König s Lemma is a basic tool to move between finite and infinite combinatorics. To be concise, we use the notation [k] = {1, 2,..., k}, and [X] r will denote
More informationMATH 433 Applied Algebra Lecture 14: Functions. Relations.
MATH 433 Applied Algebra Lecture 14: Functions. Relations. Cartesian product Definition. The Cartesian product X Y of two sets X and Y is the set of all ordered pairs (x,y) such that x X and y Y. The Cartesian
More informationTree-width. September 14, 2015
Tree-width Zdeněk Dvořák September 14, 2015 A tree decomposition of a graph G is a pair (T, β), where β : V (T ) 2 V (G) assigns a bag β(n) to each vertex of T, such that for every v V (G), there exists
More informationHamiltonian problem on claw-free and almost distance-hereditary graphs
Discrete Mathematics 308 (2008) 6558 6563 www.elsevier.com/locate/disc Note Hamiltonian problem on claw-free and almost distance-hereditary graphs Jinfeng Feng, Yubao Guo Lehrstuhl C für Mathematik, RWTH
More informationUnless otherwise specified, V denotes an arbitrary finite-dimensional vector space.
MAT 90 // 0 points Exam Solutions Unless otherwise specified, V denotes an arbitrary finite-dimensional vector space..(0) Prove: a central arrangement A in V is essential if and only if the dual projective
More informationDecomposing planar cubic graphs
Decomposing planar cubic graphs Arthur Hoffmann-Ostenhof Tomáš Kaiser Kenta Ozeki Abstract The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree,
More informationCographs; chordal graphs and tree decompositions
Cographs; chordal graphs and tree decompositions Zdeněk Dvořák September 14, 2015 Let us now proceed with some more interesting graph classes closed on induced subgraphs. 1 Cographs The class of cographs
More informationFinite Induced Graph Ramsey Theory: On Partitions of Subgraphs
inite Induced Graph Ramsey Theory: On Partitions of Subgraphs David S. Gunderson and Vojtěch Rödl Emory University, Atlanta GA 30322. Norbert W. Sauer University of Calgary, Calgary, Alberta, Canada T2N
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationGraphs and digraphs with all 2 factors isomorphic
Graphs and digraphs with all 2 factors isomorphic M. Abreu, Dipartimento di Matematica, Università della Basilicata, I-85100 Potenza, Italy. e-mail: abreu@math.fau.edu R.E.L. Aldred, University of Otago,
More informationStrongly chordal and chordal bipartite graphs are sandwich monotone
Strongly chordal and chordal bipartite graphs are sandwich monotone Pinar Heggernes Federico Mancini Charis Papadopoulos R. Sritharan Abstract A graph class is sandwich monotone if, for every pair of its
More informationA reciprocity theorem for domino tilings
A reciprocity theorem for domino tilings James Propp Department of Mathematics University of Wisconsin Madison, Wisconsin, USA propp@math.wisc.edu Submitted: April 1, 2001; Accepted: April 30, 2001 MR
More information1 Non-deterministic Turing Machine
1 Non-deterministic Turing Machine A nondeterministic Turing machine is a generalization of the standard TM for which every configuration may yield none, or one or more than one next configurations. In
More informationCS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source Shortest
More informationPreliminaries and Complexity Theory
Preliminaries and Complexity Theory Oleksandr Romanko CAS 746 - Advanced Topics in Combinatorial Optimization McMaster University, January 16, 2006 Introduction Book structure: 2 Part I Linear Algebra
More informationEvery 3-connected, essentially 11-connected line graph is Hamiltonian
Journal of Combinatorial Theory, Series B 96 (26) 571 576 www.elsevier.com/locate/jctb Every 3-connected, essentially 11-connected line graph is Hamiltonian Hong-Jian Lai a, Yehong Shao b, Hehui Wu a,
More informationAn Introduction to Spectral Graph Theory
An Introduction to Spectral Graph Theory Mackenzie Wheeler Supervisor: Dr. Gary MacGillivray University of Victoria WheelerM@uvic.ca Outline Outline 1. How many walks are there from vertices v i to v j
More informationTHE EXCHANGE GRAPH AND VARIATIONS OF THE RATIO OF THE TWO SYMANZIK POLYNOMIALS
THE EXCHANGE GRAPH AND VARIATIONS OF THE RATIO OF THE TWO SYMANZIK POLYNOMIALS OMID AMINI Abstract. Correlation functions in quantum field theory are calculated using Feynman amplitudes, which are finite
More informationEuclidean Distance Matrices, Semidefinite Programming, and Sensor Network Localization
Euclidean Distance Matrices, Semidefinite Programming, and Sensor Network Localization Abdo Y. Alfakih Miguel F. Anjos Veronica Piccialli Henry Wolkowicz November 2, 2009 University of Waterloo Department
More informationVertex colorings of graphs without short odd cycles
Vertex colorings of graphs without short odd cycles Andrzej Dudek and Reshma Ramadurai Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 1513, USA {adudek,rramadur}@andrew.cmu.edu
More informationACO Comprehensive Exam October 14 and 15, 2013
1. Computability, Complexity and Algorithms (a) Let G be the complete graph on n vertices, and let c : V (G) V (G) [0, ) be a symmetric cost function. Consider the following closest point heuristic for
More informationCombining the cycle index and the Tutte polynomial?
Combining the cycle index and the Tutte polynomial? Peter J. Cameron University of St Andrews Combinatorics Seminar University of Vienna 23 March 2017 Selections Students often meet the following table
More informationCharacterizing binary matroids with no P 9 -minor
1 2 Characterizing binary matroids with no P 9 -minor Guoli Ding 1 and Haidong Wu 2 1. Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana, USA Email: ding@math.lsu.edu 2. Department
More informationOn the Path-width of Planar Graphs
On the Path-width of Planar Graphs Omid Amini 1,2 Florian Huc 1 Stéphane Pérennes 1 FirstName.LastName@sophia.inria.fr Abstract In this paper, we present a result concerning the relation between the path-with
More informationApplications of the Lopsided Lovász Local Lemma Regarding Hypergraphs
Regarding Hypergraphs Ph.D. Dissertation Defense April 15, 2013 Overview The Local Lemmata 2-Coloring Hypergraphs with the Original Local Lemma Counting Derangements with the Lopsided Local Lemma Lopsided
More informationACO Comprehensive Exam March 20 and 21, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms Part a: You are given a graph G = (V,E) with edge weights w(e) > 0 for e E. You are also given a minimum cost spanning tree (MST) T. For one particular edge
More informationCluster algebras, snake graphs and continued fractions. Ralf Schiffler
Cluster algebras, snake graphs and continued fractions Ralf Schiffler Intro Cluster algebras Continued fractions Snake graphs Intro Cluster algebras Continued fractions expansion formula via perfect matchings
More informationarxiv: v1 [math.co] 20 Sep 2012
arxiv:1209.4628v1 [math.co] 20 Sep 2012 A graph minors characterization of signed graphs whose signed Colin de Verdière parameter ν is two Marina Arav, Frank J. Hall, Zhongshan Li, Hein van der Holst Department
More informationGraph fundamentals. Matrices associated with a graph
Graph fundamentals Matrices associated with a graph Drawing a picture of a graph is one way to represent it. Another type of representation is via a matrix. Let G be a graph with V (G) ={v 1,v,...,v n
More informationALL GRAPHS WITH PAIRED-DOMINATION NUMBER TWO LESS THAN THEIR ORDER. Włodzimierz Ulatowski
Opuscula Math. 33, no. 4 (2013), 763 783 http://dx.doi.org/10.7494/opmath.2013.33.4.763 Opuscula Mathematica ALL GRAPHS WITH PAIRED-DOMINATION NUMBER TWO LESS THAN THEIR ORDER Włodzimierz Ulatowski Communicated
More informationGraph Theory Notes. January 15, H. A. Kierstead
Graph Theory Notes January 15, 2019 H. A. Kierstead CHAPTER 1 Introduction This is an on going project. There will be changes to the material not yet covered, especially just before each lecture. There
More informationTropical Constructions and Lifts
Tropical Constructions and Lifts Hunter Ash August 27, 2014 1 The Algebraic Torus and M Let K denote a field of characteristic zero and K denote the associated multiplicative group. A character on (K )
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More information1 Matroid intersection
CS 369P: Polyhedral techniques in combinatorial optimization Instructor: Jan Vondrák Lecture date: October 21st, 2010 Scribe: Bernd Bandemer 1 Matroid intersection Given two matroids M 1 = (E, I 1 ) and
More informationHow many randomly colored edges make a randomly colored dense graph rainbow hamiltonian or rainbow connected?
How many randomly colored edges make a randomly colored dense graph rainbow hamiltonian or rainbow connected? Michael Anastos and Alan Frieze February 1, 2018 Abstract In this paper we study the randomly
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Matroids and Greedy Algorithms Date: 10/31/16
60.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Matroids and Greedy Algorithms Date: 0/3/6 6. Introduction We talked a lot the last lecture about greedy algorithms. While both Prim
More informationGraphs with Flexible Labelings allowing Injective Realizations
Graphs with Flexible Labelings allowing Injective Realizations Georg Grasegger Jan Legerský Josef Schicho arxiv:1811.06709v1 [math.co] 16 Nov 2018 We consider realizations of a graph in the plane such
More informationOn the number of F -matchings in a tree
On the number of F -matchings in a tree Hiu-Fai Law Mathematical Institute Oxford University hiufai.law@gmail.com Submitted: Jul 18, 2011; Accepted: Feb 4, 2012; Published: Feb 23, 2012 Mathematics Subject
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationToughness and prism-hamiltonicity of P 4 -free graphs
Toughness and prism-hamiltonicity of P 4 -free graphs M. N. Ellingham Pouria Salehi Nowbandegani Songling Shan Department of Mathematics, 1326 Stevenson Center, Vanderbilt University, Nashville, TN 37240
More informationON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS
Discussiones Mathematicae Graph Theory 34 (2014) 127 136 doi:10.7151/dmgt.1724 ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Dingguo Wang 2,3 and Erfang Shan 1,2 1 School of Management,
More informationUSING GRAPHS AND GAMES TO GENERATE CAP SET BOUNDS
USING GRAPHS AND GAMES TO GENERATE CAP SET BOUNDS JOSH ABBOTT AND TREVOR MCGUIRE Abstract. Let F 3 be the field with 3 elements and consider the k- dimensional affine space, F k 3, over F 3. A line of
More informationNeutrosophic Graphs: A New Dimension to Graph Theory. W. B. Vasantha Kandasamy Ilanthenral K Florentin Smarandache
Neutrosophic Graphs: A New Dimension to Graph Theory W. B. Vasantha Kandasamy Ilanthenral K Florentin Smarandache 2015 This book can be ordered from: EuropaNova ASBL Clos du Parnasse, 3E 1000, Bruxelles
More informationGeneralized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
More informationOn shredders and vertex connectivity augmentation
On shredders and vertex connectivity augmentation Gilad Liberman The Open University of Israel giladliberman@gmail.com Zeev Nutov The Open University of Israel nutov@openu.ac.il Abstract We consider the
More informationEulerian Subgraphs and Hamilton-Connected Line Graphs
Eulerian Subgraphs and Hamilton-Connected Line Graphs Hong-Jian Lai Department of Mathematics West Virginia University Morgantown, WV 2606, USA Dengxin Li Department of Mathematics Chongqing Technology
More information