DOCSLIB.ORG

Trees and Distance, Graph Theory, Networks and Applications, MAA600

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Trees and Distance, Graph Theory, Networks and Applications, MAA600 Trees and distance, Graph theory, networks and applications, MAA600 Christopher Engstr¨om Trees and distance, Lecture 5, trees and Graph theory, networks and applications, distance MAA600 Distance in trees and graphs Christopher Engstr¨om September 15, 2014 I If the graph is connected and acyclic it is called a tree I A vertex with degree one (only 1 connecting edge) is called a leaf. I A subgraph of G with the same vertex set V (G) is called a spanning subgraph. (note that it does not need to be connected nor acyclic). I A spanning forest is a spanning subgraph which is also a forest. I A spanning tree is a spanning subgraph which is also a tree. Trees and Definitions distance, Graph theory, networks and applications, Definition MAA600 Christopher Engstr¨om I A graph with no cycle is called acyclic. Such a graph is called a forest. Lecture 5, trees and distance Distance in trees and graphs I A vertex with degree one (only 1 connecting edge) is called a leaf. I A subgraph of G with the same vertex set V (G) is called a spanning subgraph. (note that it does not need to be connected nor acyclic). I A spanning forest is a spanning subgraph which is also a forest. I A spanning tree is a spanning subgraph which is also a tree. Trees and Definitions distance, Graph theory, networks and applications, Definition MAA600 Christopher Engstr¨om I A graph with no cycle is called acyclic. Such a graph is called a forest. Lecture 5, trees and distance I If the graph is connected and acyclic it is called a tree Distance in trees and graphs I A subgraph of G with the same vertex set V (G) is called a spanning subgraph. (note that it does not need to be connected nor acyclic). I A spanning forest is a spanning subgraph which is also a forest. I A spanning tree is a spanning subgraph which is also a tree. Trees and Definitions distance, Graph theory, networks and applications, Definition MAA600 Christopher Engstr¨om I A graph with no cycle is called acyclic. Such a graph is called a forest. Lecture 5, trees and distance I If the graph is connected and acyclic it is called a tree Distance in I A vertex with degree one (only 1 connecting edge) is trees and graphs called a leaf. I A spanning forest is a spanning subgraph which is also a forest. I A spanning tree is a spanning subgraph which is also a tree. Trees and Definitions distance, Graph theory, networks and applications, Definition MAA600 Christopher Engstr¨om I A graph with no cycle is called acyclic. Such a graph is called a forest. Lecture 5, trees and distance I If the graph is connected and acyclic it is called a tree Distance in I A vertex with degree one (only 1 connecting edge) is trees and graphs called a leaf. I A subgraph of G with the same vertex set V (G) is called a spanning subgraph. (note that it does not need to be connected nor acyclic). I A spanning tree is a spanning subgraph which is also a tree. Trees and Definitions distance, Graph theory, networks and applications, Definition MAA600 Christopher Engstr¨om I A graph with no cycle is called acyclic. Such a graph is called a forest. Lecture 5, trees and distance I If the graph is connected and acyclic it is called a tree Distance in I A vertex with degree one (only 1 connecting edge) is trees and graphs called a leaf. I A subgraph of G with the same vertex set V (G) is called a spanning subgraph. (note that it does not need to be connected nor acyclic). I A spanning forest is a spanning subgraph which is also a forest. Trees and Definitions distance, Graph theory, networks and applications, Definition MAA600 Christopher Engstr¨om I A graph with no cycle is called acyclic. Such a graph is called a forest. Lecture 5, trees and distance I If the graph is connected and acyclic it is called a tree Distance in I A vertex with degree one (only 1 connecting edge) is trees and graphs called a leaf. I A subgraph of G with the same vertex set V (G) is called a spanning subgraph. (note that it does not need to be connected nor acyclic). I A spanning forest is a spanning subgraph which is also a forest. I A spanning tree is a spanning subgraph which is also a tree. This essentially means that every tree with more than one vertex can be constructed from a smaller tree by adding a new leaf. Trees and Trees distance, Graph theory, networks and applications, MAA600 Christopher Engstr¨om Lecture 5, trees and Lemma distance Every tree with at least two vertices has at least two leaves. Distance in trees and Deleting a leaf from a tree with n vertices produces a new tree graphs with n − 1 vertices. Trees and Trees distance, Graph theory, networks and applications, MAA600 Christopher Engstr¨om Lecture 5, trees and Lemma distance Every tree with at least two vertices has at least two leaves. Distance in trees and Deleting a leaf from a tree with n vertices produces a new tree graphs with n − 1 vertices. This essentially means that every tree with more than one vertex can be constructed from a smaller tree by adding a new leaf. I G is connected and has n − 1 edges. I G has n − 1 edges and has no cycles. I G has no loops, and for every u; v 2 V (G) there is exactly one path from u to v. We will show the first statement, the others can be proved in a similar manner. Trees and Trees distance, Graph theory, networks and applications, MAA600 Christopher Engstr¨om Theorem For an n-vertex graph G (with n ≥ 1), the following statements Lecture 5, trees and are equivalent. distance Distance in I G is connected and has no cycles (a tree). trees and graphs I G has n − 1 edges and has no cycles. I G has no loops, and for every u; v 2 V (G) there is exactly one path from u to v. We will show the first statement, the others can be proved in a similar manner. Trees and Trees distance, Graph theory, networks and applications, MAA600 Christopher Engstr¨om Theorem For an n-vertex graph G (with n ≥ 1), the following statements Lecture 5, trees and are equivalent. distance Distance in I G is connected and has no cycles (a tree). trees and graphs I G is connected and has n − 1 edges. I G has no loops, and for every u; v 2 V (G) there is exactly one path from u to v. We will show the first statement, the others can be proved in a similar manner. Trees and Trees distance, Graph theory, networks and applications, MAA600 Christopher Engstr¨om Theorem For an n-vertex graph G (with n ≥ 1), the following statements Lecture 5, trees and are equivalent. distance Distance in I G is connected and has no cycles (a tree). trees and graphs I G is connected and has n − 1 edges. I G has n − 1 edges and has no cycles. We will show the first statement, the others can be proved in a similar manner. Trees and Trees distance, Graph theory, networks and applications, MAA600 Christopher Engstr¨om Theorem For an n-vertex graph G (with n ≥ 1), the following statements Lecture 5, trees and are equivalent. distance Distance in I G is connected and has no cycles (a tree). trees and graphs I G is connected and has n − 1 edges. I G has n − 1 edges and has no cycles. I G has no loops, and for every u; v 2 V (G) there is exactly one path from u to v. We will show the first statement, the others can be proved in a similar manner. Trees and Trees distance, Graph theory, networks and applications, MAA600 Christopher Engstr¨om Theorem For an n-vertex graph G (with n ≥ 1), the following statements Lecture 5, trees and are equivalent. distance Distance in I G is connected and has no cycles (a tree). trees and graphs I G is connected and has n − 1 edges. I G has n − 1 edges and has no cycles. I G has no loops, and for every u; v 2 V (G) there is exactly one path from u to v. Trees and Trees distance, Graph theory, networks and applications, MAA600 Christopher Engstr¨om Theorem For an n-vertex graph G (with n ≥ 1), the following statements Lecture 5, trees and are equivalent. distance Distance in I G is connected and has no cycles (a tree). trees and graphs I G is connected and has n − 1 edges. I G has n − 1 edges and has no cycles. I G has no loops, and for every u; v 2 V (G) there is exactly one path from u to v. We will show the first statement, the others can be proved in a similar manner. Trees and Proof distance, Graph theory, networks and applications, MAA600 Christopher Engstr¨om To prove that statement 1; 2; 3 are equivalent it is enough to Lecture 5, show that any two of (connected, acyclic, n − 1 edges) implies trees and distance the third. Distance in (connected, acyclic) ) n − 1 edges: It is easy to see that trees and graphs n − 1 edges are enough and necessary in order for a graph to be connected.
Load more

Recommended publications
  • Geodesic Distance Descriptors
    Geodesic Distance Descriptors Gil Shamai and Ron Kimmel Technion - Israel Institute of Technologies [email protected] [email protected] Abstract efficiency of state of the art shape matching procedures. The Gromov-Hausdorff (GH) distance is traditionally used for measuring distances between metric spaces. It 1. Introduction was adapted for non-rigid shape comparison and match- One line of thought in shape analysis considers an ob- ing of isometric surfaces, and is defined as the minimal ject as a metric space, and object matching, classification, distortion of embedding one surface into the other, while and comparison as the operation of measuring the discrep- the optimal correspondence can be described as the map ancies and similarities between such metric spaces, see, for that minimizes this distortion. Solving such a minimiza- example, [13, 33, 27, 23, 8, 3, 24]. tion is a hard combinatorial problem that requires pre- Although theoretically appealing, the computation of computation and storing of all pairwise geodesic distances distances between metric spaces poses complexity chal- for the matched surfaces. A popular way for compact repre- lenges as far as direct computation and memory require- sentation of functions on surfaces is by projecting them into ments are involved. As a remedy, alternative representa- the leading eigenfunctions of the Laplace-Beltrami Opera- tion spaces were proposed [26, 22, 15, 10, 31, 30, 19, 20]. tor (LBO). When truncated, the basis of the LBO is known The question of which representation to use in order to best to be the optimal for representing functions with bounded represent the metric space that define each form we deal gradient in a min-max sense.
    [Show full text]
  • Exclusive Graph Searching Lélia Blin, Janna Burman, Nicolas Nisse
    Exclusive Graph Searching Lélia Blin, Janna Burman, Nicolas Nisse To cite this version: Lélia Blin, Janna Burman, Nicolas Nisse. Exclusive Graph Searching. Algorithmica, Springer Verlag, 2017, 77 (3), pp.942-969. 10.1007/s00453-016-0124-0. hal-01266492 HAL Id: hal-01266492 https://hal.archives-ouvertes.fr/hal-01266492 Submitted on 2 Feb 2016 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Exclusive Graph Searching∗ L´eliaBlin Sorbonne Universit´es, UPMC Univ Paris 06, CNRS, Universit´ed'Evry-Val-d'Essonne. LIP6 UMR 7606, 4 place Jussieu 75005, Paris, France [email protected] Janna Burman LRI, Universit´eParis Sud, CNRS, UMR-8623, France. [email protected] Nicolas Nisse Inria, France. Univ. Nice Sophia Antipolis, CNRS, I3S, UMR 7271, Sophia Antipolis, France. [email protected] February 2, 2016 Abstract This paper tackles the well known graph searching problem, where a team of searchers aims at capturing an intruder in a network, modeled as a graph. This problem has been mainly studied for its relationship with the pathwidth of graphs. All variants of this problem assume that any node can be simultaneously occupied by several searchers.
    [Show full text]
  • Network Science
    This is a preprint of Katy Börner, Soma Sanyal and Alessandro Vespignani (2007) Network Science. In Blaise Cronin (Ed) Annual Review of Information Science & Technology, Volume 41. Medford, NJ: Information Today, Inc./American Society for Information Science and Technology, chapter 12, pp. 537-607. Network Science Katy Börner School of Library and Information Science, Indiana University, Bloomington, IN 47405, USA [email protected] Soma Sanyal School of Library and Information Science, Indiana University, Bloomington, IN 47405, USA [email protected] Alessandro Vespignani School of Informatics, Indiana University, Bloomington, IN 47406, USA [email protected] 1. Introduction.............................................................................................................................................2 2. Notions and Notations.............................................................................................................................4 2.1 Graphs and Subgraphs .........................................................................................................................5 2.2 Graph Connectivity..............................................................................................................................7 3. Network Sampling ..................................................................................................................................9 4. Network Measurements........................................................................................................................11
    [Show full text]
  • Latent Distance Estimation for Random Geometric Graphs ∗
    Latent Distance Estimation for Random Geometric Graphs ∗ Ernesto Araya Valdivia Laboratoire de Math´ematiquesd'Orsay (LMO) Universit´eParis-Sud 91405 Orsay Cedex France Yohann De Castro Ecole des Ponts ParisTech-CERMICS 6 et 8 avenue Blaise Pascal, Cit´eDescartes Champs sur Marne, 77455 Marne la Vall´ee,Cedex 2 France Abstract: Random geometric graphs are a popular choice for a latent points generative model for networks. Their definition is based on a sample of n points X1;X2; ··· ;Xn on d−1 the Euclidean sphere S which represents the latent positions of nodes of the network. The connection probabilities between the nodes are determined by an unknown function (referred to as the \link" function) evaluated at the distance between the latent points. We introduce a spectral estimator of the pairwise distance between latent points and we prove that its rate of convergence is the same as the nonparametric estimation of a d−1 function on S , up to a logarithmic factor. In addition, we provide an efficient spectral algorithm to compute this estimator without any knowledge on the nonparametric link function. As a byproduct, our method can also consistently estimate the dimension d of the latent space. MSC 2010 subject classifications: Primary 68Q32; secondary 60F99, 68T01. Keywords and phrases: Graphon model, Random Geometric Graph, Latent distances estimation, Latent position graph, Spectral methods. 1. Introduction Random geometric graph (RGG) models have received attention lately as alternative to some simpler yet unrealistic models as the ubiquitous Erd¨os-R´enyi model [11]. They are generative latent point models for graphs, where it is assumed that each node has associated a latent d point in a metric space (usually the Euclidean unit sphere or the unit cube in R ) and the connection probability between two nodes depends on the position of their associated latent points.
    [Show full text]
  • Average D-Distance Between Vertices of a Graph
    italian journal of pure and applied mathematics { n. 33¡2014 (293¡298) 293 AVERAGE D-DISTANCE BETWEEN VERTICES OF A GRAPH D. Reddy Babu Department of Mathematics Koneru Lakshmaiah Education Foundation (K.L. University) Vaddeswaram Guntur 522 502 India e-mail: [email protected], [email protected] P.L.N. Varma Department of Science & Humanities V.F.S.T.R. University Vadlamudi Guntur 522 237 India e-mail: varma [email protected] Abstract. The D-distance between vertices of a graph G is obtained by considering the path lengths and as well as the degrees of vertices present on the path. The average D-distance between the vertices of a connected graph is the average of the D-distances between all pairs of vertices of the graph. In this article we study the average D-distance between the vertices of a graph. Keywords: D-distance, average D-distance, diameter. 2000 Mathematics Subject Classi¯cation: 05C12. 1. Introduction The concept of distance is one of the important concepts in study of graphs. It is used in isomorphism testing, graph operations, hamiltonicity problems, extremal problems on connectivity and diameter, convexity in graphs etc. Distance is the basis of many concepts of symmetry in graphs. In addition to the usual distance, d(u; v) between two vertices u; v 2 V (G) we have detour distance (introduced by Chartrand et al, see [2]), superior distance (introduced by Kathiresan and Marimuthu, see [6]), signal distance (introduced by Kathiresan and Sumathi, see [7]), degree distance etc. 294 d. reddy babu, p.l.n. varma In an earlier article [9], the authors introduced the concept of D-distance be- tween vertices of a graph G by considering not only path length between vertices, but also the degrees of all vertices present in a path while de¯ning the D-distance.
    [Show full text]
  • Discrete Mathematics Rooted Directed Path Graphs Are Leaf Powers
    Discrete Mathematics 310 (2010) 897–910 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Rooted directed path graphs are leaf powers Andreas Brandstädt a, Christian Hundt a, Federico Mancini b, Peter Wagner a a Institut für Informatik, Universität Rostock, D-18051, Germany b Department of Informatics, University of Bergen, N-5020 Bergen, Norway article info a b s t r a c t Article history: Leaf powers are a graph class which has been introduced to model the problem of Received 11 March 2009 reconstructing phylogenetic trees. A graph G D .V ; E/ is called k-leaf power if it admits a Received in revised form 2 September 2009 k-leaf root, i.e., a tree T with leaves V such that uv is an edge in G if and only if the distance Accepted 13 October 2009 between u and v in T is at most k. Moroever, a graph is simply called leaf power if it is a Available online 30 October 2009 k-leaf power for some k 2 N. This paper characterizes leaf powers in terms of their relation to several other known graph classes. It also addresses the problem of deciding whether a Keywords: given graph is a k-leaf power. Leaf powers Leaf roots We show that the class of leaf powers coincides with fixed tolerance NeST graphs, a Graph class inclusions well-known graph class with absolutely different motivations. After this, we provide the Strongly chordal graphs largest currently known proper subclass of leaf powers, i.e, the class of rooted directed path Fixed tolerance NeST graphs graphs.
    [Show full text]
  • "Distance Measures for Graph Theory"
    Distance measures for graph theory : Comparisons and analyzes of different methods Dissertation presented by Maxime DUYCK for obtaining the Master’s degree in Mathematical Engineering Supervisor(s) Marco SAERENS Reader(s) Guillaume GUEX, Bertrand LEBICHOT Academic year 2016-2017 Acknowledgments First, I would like to thank my supervisor Pr. Marco Saerens for his presence, his advice and his precious help throughout the realization of this thesis. Second, I would also like to thank Bertrand Lebichot and Guillaume Guex for agreeing to read this work. Next, I would like to thank my parents, all my family and my friends to have accompanied and encouraged me during all my studies. Finally, I would thank Malian De Ron for creating this template [65] and making it available to me. This helped me a lot during “le jour et la nuit”. Contents 1. Introduction 1 1.1. Context presentation .................................. 1 1.2. Contents .......................................... 2 2. Theoretical part 3 2.1. Preliminaries ....................................... 4 2.1.1. Networks and graphs .............................. 4 2.1.2. Useful matrices and tools ........................... 4 2.2. Distances and kernels on a graph ........................... 7 2.2.1. Notion of (dis)similarity measures ...................... 7 2.2.2. Kernel on a graph ................................ 8 2.2.3. The shortest-path distance .......................... 9 2.3. Kernels from distances ................................. 9 2.3.1. Multidimensional scaling ............................ 9 2.3.2. Gaussian mapping ............................... 9 2.4. Similarity measures between nodes .......................... 9 2.4.1. Katz index and its Leicht’s extension .................... 10 2.4.2. Commute-time distance and Euclidean commute-time distance .... 10 2.4.3. SimRank similarity measure .........................
    [Show full text]
  • Compact Representation of Graphs with Small Bandwidth and Treedepth
    Compact Representation of Graphs with Small Bandwidth and Treedepth Shahin Kamali University of Manitoba Winnipeg, MB, R3T 2N2, Canada [email protected] Abstract We consider the problem of compact representation of graphs with small bandwidth as well as graphs with small treedepth. These parameters capture structural properties of graphs that come in useful in certain applications. We present simple navigation oracles that support degree and adjacency queries in constant time and neighborhood query in constant time per neighbor. For graphs of bandwidth k, our oracle takesp (k + dlog 2ke)n + o(kn) bits. By way of an enumeration technique, we show that (k − 5 k − 4)n − O(k2) bits are required to encode a graph of bandwidth k and size n. For graphs of treedepth k, our oracle takes (k + dlog ke + 2)n + o(kn) bits. We present a lower bound that certifies our oracle is succinct for certain values of k 2 o(n). 1 Introduction Graphs are among the most relevant ways to model relationships between objects. Given the ever-growing number of objects to model, it is increasingly important to store the underlying graphs in a compact manner in order to facilitate designing efficient algorithmic solutions. One simple way to represent graphs is to consider them as random objects without any particular structure. There are two issues, however, with such general approach. First, many computational problems are NP-hard on general graphs and often remain hard to approximate. Second, random graphs are highly incompressible and cannot be stored compactly [1]. At the same time, graphs that arise in practice often have combinatorial structures that can -and should- be exploited to provide space-efficient representations.
    [Show full text]
  • Percolation Theory Are Well-Suited To
    Models of Disordered Media and Predictions of Associated Hydraulic Conductivity A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science By L AARON BLANK B.S., Wright State University, 2004 2006 Wright State University WRIGHT STATE UNIVERSITY SCHOOL OF GRADUATE STUDIES Novermber 6, 2006 I HEREBY RECOMMEND THAT THE THESIS PREPARED UNDER MY SUPERVISION BY L Blank ENTITLED Models of Disordered Media and Predictions of Associated Hydraulic Conductivity BE ACCEPTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF Master of Science. _______________________ Allen Hunt, Ph.D. Thesis Advisor _______________________ Lok Lew Yan Voon, Ph.D. Department Chair _______________________ Joseph F. Thomas, Jr., Ph.D. Dean of the School of Graduate Studies Committee on Final Examination ____________________ Allen Hunt, Ph.D. ____________________ Brent D. Foy, Ph.D. ____________________ Gust Bambakidis, Ph.D. ____________________ Thomas Skinner, Ph.D. Abstract In the late 20th century there was a spill of Technetium in eastern Washington State at the US Department of Energy Hanford site. Resulting contamination of water supplies would raise serious health issues for local residents. Therefore, the ability to predict how these contaminants move through the soil is of great interest. The main contribution to contaminant transport arises from being carried along by flowing water. An important control on the movement of the water through the medium is the hydraulic conductivity, K, which defines the ease of water flow for a given pressure difference (analogous to the electrical conductivity). The overall goal of research in this area is to develop a technique which accurately predicts the hydraulic conductivity as well as its distribution, both in the horizontal and the vertical directions, for media representative of the Hanford subsurface.
    [Show full text]
  • Branch-Depth: Generalizing Tree-Depth of Graphs
    Branch-depth: Generalizing tree-depth of graphs ∗1 †‡23 34 Matt DeVos , O-joung Kwon , and Sang-il Oum† 1Department of Mathematics, Simon Fraser University, Burnaby, Canada 2Department of Mathematics, Incheon National University, Incheon, Korea 3Discrete Mathematics Group, Institute for Basic Science (IBS), Daejeon, Korea 4Department of Mathematical Sciences, KAIST, Daejeon, Korea [email protected], [email protected], [email protected] November 5, 2020 Abstract We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the no- tions of tree-depth and shrub-depth of graphs as follows. For a graph G = (V, E) and a subset A of E we let λG(A) be the number of vertices incident with an edge in A and an edge in E A. For a subset X of V , \ let ρG(X) be the rank of the adjacency matrix between X and V X over the binary field. We prove that a class of graphs has bounded\ tree-depth if and only if the corresponding class of functions λG has arXiv:1903.11988v2 [math.CO] 4 Nov 2020 bounded branch-depth and similarly a class of graphs has bounded shrub-depth if and only if the corresponding class of functions ρG has bounded branch-depth, which we call the rank-depth of graphs. Furthermore we investigate various potential generalizations of tree- depth to matroids and prove that matroids representable over a fixed finite field having no large circuits are well-quasi-ordered by restriction.
    [Show full text]
  • An Efficient Reachability Indexing Scheme for Large Directed Graphs
    1 Path-Tree: An Efficient Reachability Indexing Scheme for Large Directed Graphs RUOMING JIN, Kent State University NING RUAN, Kent State University YANG XIANG, The Ohio State University HAIXUN WANG, Microsoft Research Asia Reachability query is one of the fundamental queries in graph database. The main idea behind answering reachability queries is to assign vertices with certain labels such that the reachability between any two vertices can be determined by the labeling information. Though several approaches have been proposed for building these reachability labels, it remains open issues on how to handle increasingly large number of vertices in real world graphs, and how to find the best tradeoff among the labeling size, the query answering time, and the construction time. In this paper, we introduce a novel graph structure, referred to as path- tree, to help labeling very large graphs. The path-tree cover is a spanning subgraph of G in a tree shape. We show path-tree can be generalized to chain-tree which theoretically can has smaller labeling cost. On top of path-tree and chain-tree index, we also introduce a new compression scheme which groups vertices with similar labels together to further reduce the labeling size. In addition, we also propose an efficient incremental update algorithm for dynamic index maintenance. Finally, we demonstrate both analytically and empirically the effectiveness and efficiency of our new approaches. Categories and Subject Descriptors: H.2.8 [Database management]: Database Applications—graph index- ing and querying General Terms: Performance Additional Key Words and Phrases: Graph indexing, reachability queries, transitive closure, path-tree cover, maximal directed spanning tree ACM Reference Format: Jin, R., Ruan, N., Xiang, Y., and Wang, H.
    [Show full text]
  • Cop Number of Graphs Without Long Holes
    Cop number of graphs without long holes Vaidy Sivaraman January 3, 2020 Abstract A hole in a graph is an induced cycle of length at least 4. We give a simple winning strategy for t − 3 cops to capture a robber in the game of cops and robbers played in a graph that does not contain a hole of length at least t. This strengthens a theorem of Joret-Kaminski-Theis, who proved that t − 2 cops have a winning strategy in such graphs. As a consequence of our bound, we also give an inequality relating the cop number and the Dilworth number of a graph. The game of cops and robbers is played on a finite simple graph G. There are k cops and a single robber. Each of the cops chooses a vertex to start, and then the robber chooses a vertex. And then they alternate turns starting with the cop. In the turn of cops, each cop either stays on the vertex or moves to a neighboring vertex. In the robber’s turn, he stays on the same vertex or moves to a neighboring vertex. The cops win if at any point in time, one of the cops lands on the robber. The robber wins if he can avoid being captured. The cop number of G, denoted c(G), is the minimum number of cops needed so that the cops have a winning strategy in G. The question of what makes a graph to have high cop number is not clearly understood. Some fundamental results were proved in [1] and [9].
    [Show full text]