DOCSLIB.ORG

Zero Forcing and Power Domination in Graphs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

ZERO FORCING AND POWER DOMINATION IN GRAPHS SUDEEP STEPHEN Master of Science (Mathematics)(University of Madras) School of Mathematical and Physical Sciences The University of Newcastle, Australia A thesis submitted in total fulfilment of the requirements for the degree of Doctor of Philosophy October 2017 Statements Statement of Originality The thesis contains no material which has been accepted for the award of any other degree or diploma in any university or other tertiary institution and, to the best of my knowledge and belief, contains no material previously published or written by another person, except where due reference has been made in the text. I give consent to the final version of my thesis being made available worldwide when deposited in the University's Digital Repository, subject to the provisions of the Copyright Act 1968. Statement of Authorship I hereby certify that the work embodied in this thesis contains published papers of which I am a joint author. I have included as part of the thesis a written statement, endorsed by my supervisor, attesting to my contribution to the joint publication. Signed: SUDEEP STEPHEN The candidate has six papers, of which he is a joint author, embodied in the thesis. As principal supervisor I can attest that the candidate's contribution, in all cases were at least 80% of the final article. Signed: Dr JOE RYAN iv List of Publications Publications Arising from this Thesis (1) D. Ferrero, T. Kalinowski and S. Stephen. Zero forcing in iterated line digraphs. Submitted to Discrete Applied Mathematics, 2017 [37]. (2) R. Davila, T. Kalinowski and S. Stephen. Proof of a conjecture of Davila and Kenter regarding a lower bound for the forcing number in terms of girth and minimum degree. Submitted to Discrete Applied Mathematics, 2016 [23]. (3) D. Ferrero, C. Grigorious, T. Kalinowski, J. Ryan and S. Stephen. Minimum rank and zero forcing number for butterfly networks. Submitted to Discrete Applied Mathematics, 2016 [38]. (4) C. Grigorious, T. Kalinowski, J. Ryan and S. Stephen. On the power domination number of de Bruijn and Kautz digraphs. To appear in Lecture Notes in Computer Science, 2017 [45]. (5) S. Stephen, B. Rajan, C. Grigorious and A. William. Resolving-power dominating sets. Applied Mathematics and Computation, 256, 778{785, 2015 [85]. (6) S. Stephen, B. Rajan, J. Ryan, C. Grigorious and A. William. Power domination in certain chemical structures. Journal of Discrete Algorithms, 33, 10{18, 2015 [86]. Other Publications Produced During my Candidature (1) C. Grigorious, T. Kalinowski, J. Ryan and S. Stephen. Metric dimension of Circulant graph C(n; ±{1; 2; 3; 4g). The Australasian Journal of Combinatorics, 69 (3), 417{ 441, 2017 [46]. (2) C. Grigorious, S. Stephen, B. Rajan and M. Miller. On the Partition Dimension of Circulant Graphs. The Computer Journal, 60 (2), 180{184, 2016 [48]. (3) S. Klavˇzar, P. Manuel, M. J. Nadjafi-Arani, R. S. Rajan, C. Grigorious and S. Stephen. Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs. The Computer Journal, 59(12), 1900{1910, 2016 [68]. (4) C. Grigorious, P. Manuel, M. Miller, B. Rajan and S. Stephen. On the metric dimension of circulant and Harary graphs. Applied Mathematics and Computation, 248, 47{54, 2014 [47]. (5) P. Manuel, B. Rajan, C. Grigorious and S. Stephen. On the Strong Metric Dimen- sion of Tetrahedral Diamond Lattice. Mathematics in Computer Science, 9, 201{208, 2015 [76]. (6) C. Grigorious, S. Stephen, B. Rajan, M. Miller and A. William. On the Partition Dimension of a Class of Circulant Graphs. Information Processing Letters, 114, 353{ 356, 2014 [49]. To my parents, Stephen P.M and Mary Stephen And in memory of my most beloved supervisor, Mirka Miller. Acknowledgements First and foremost, I would like to express my sincere gratitude to my su- pervisors, (L) Prof. Mirka Miller, Dr. Joe Ryan, Dr. Thomas Kalinowski and Dr. Paul Manuel, who have supported me with their encouragement, guidance and patience. My sincere gratitude to Mirka and Joe, without them, I would never have been in Newcastle. Thank you for trusting my research capabilities and above all for the emotional and practical support whenever I needed them. Thank you for teaching how to build collaborations and introducing me to all your collaborators. I can never forget the good times we had spent together. Your motivations and encouragements helped me to be a better person and a researcher. It was indeed a tough phase for me and Joe after Mirka lost her battle with cancer. Thank you Joe for being there always and guiding me through the completion of my candidature. I am happy we did this together for Mirka. I specially like to acknowledge Thomas Kalinowski for his insightful sug- gestions and comments on my research and talks at every stage of my Ph.D. I am always inspired by his work. To be very honest, I have always looked up at him as my role model. I also thank Dr. Paul Manuel for contributing 25% towards my scholarship. My special thanks to Dr. Bharati Rajan, my mentor, for introducing me to graph theory and research. I owe what I am today to you. I am thankful to Dr. Cristina Dalfo Simo, my external supervisor for her inputs and support during my Ph.D candidature. I am grateful to Prof. Indra Rajasingh and Dr. Sundara Rajan for their encouragement and support during my initial stages of research in Chennai. Discussions and chats with Prof. Brian Alspach were always interesting and helpful. Thank you. I am also thankful to Renee Mam and the entire Maths department of St. Joseph's College, Bangalore for inspiring me to do research in mathematics. I like to thank Prof. Zdenek Ryacek and Prof. Dafik for hosting me during my stay in The University of West Bohemia, Czech Republic and University of Jember, Indonesia respectively. I also like to thank my col- laborators Randy Davila, Prof. Daniela Ferrero and Prof. Sandi Klavzar for accepting my request to work with me and sharing their knowledge. It was indeed wonderful 3 years in Newcastle. I would like to acknowledge Dr. Benny Sudakov for pointing out the argument for Theorem 5.2.3 on his visit to the University of Newcastle during the 40 ACCMCC. Thanks to the University of Newcastle for providing scholarships (UNIPRS and UNRSC 50-25) to pursue my dream. I thank the International Leader- ship Experience and Development (ILEAD) Plus Program for the generous support for participating in various conferences. I acknowledge the Faculty of Sciences for the Conference scholarship. My sincere thanks to the school of mathematical and physical sciences. All the staff, both academic and administrative staff created a healthy and comfortable environment for me to pursue my research. Many thanks to all of them for their supports and efforts. Special thanks to Vicki, Anna Rosa, Irene, Rosemary and Felicity for their administrative help whenever I needed them. To my friend and colleague Cyriac Grigorious, thank you so much for being there with me for the past 8 years. You have influenced my life more than you can imagine. Thank you for the support and friendship during my stay here. To my office mates, Bong, Dushyant, Oudone and Wulan, thank you for bearing me. Thanks to the Malayali community in Newcastle and Sydney for making me welcome among them and making me feel at home away from home. I am indebted to my parents, Stephen P. M and Mary Stephen, my wife, Jinu Joseph, my brother, Suraj Stephen, my sister-in-law, Rakhi Ashok and my nephew, Aswin Suraj, for their love and support during these years. A special word of acknowledgement to Mr. Simon, Saly amme, Ashwin and Ada for considering me a part of their family. Thank you for the unconditional love you have shown towards me. Saly amme, thank you so much for being there like a mother encouraging, supporting and guiding me through various frustrations and disappointments. Last but not least, I thank God Almighty for blessing me with this opportunity to pursue my research and for giving me sound body and mind to complete this successfully. Sudeep Stephen Contents List of Figures xi Nomenclature xv Chapter 1. Introduction1 1.1. Contributions of the thesis3 1.2. Structure of the thesis3 Chapter 2. Background Theory5 2.1. Graph theory5 2.1.1. Undirected graphs5 2.1.2. Graph operations8 2.1.3. Directed graphs 10 2.2. Zero forcing in graphs 11 2.2.1. Bounds on the zero forcing number 17 2.2.2. Zero forcing in directed graphs 21 2.2.3. Variants of zero forcing problem 23 2.3. Power domination in graphs 24 2.3.1. Bounds on the power domination number 26 2.3.2. Power domination in directed graphs 31 2.3.3. Variants of power domination problem 32 2.4. Zero forcing and power domination 33 Chapter 3. Zero forcing and power domination in iterated line digraphs 35 3.1. An alternate interpretation 35 3.2. Zero forcing and power domination in de Bruijn digraphs 38 3.3. Zero forcing and power domination number in Kautz digraphs 41 3.4. Zero forcing in iterated line digraphs 45 3.5. Power domination in iterated line digraphs 48 3.6. Applications 52 Chapter 4. Zero forcing and power domination in butterfly networks 55 4.1. An alternate interpretation 55 4.2. Zero forcing in butterfly network 57 ix x CONTENTS 4.2.1. The upper bound for Z(BF(r)) 58 4.2.2. The lower bound for Z(BF(r)) 62 4.3. Power domination in butterfly network 71 Chapter 5. Zero forcing number in terms of girth and minimum degree 77 5.1.
Recommended publications
  • On the Density of a Graph and Its Blowup

    On the Density of a Graph and Its Blowup

    On the Density of a Graph and its Blowup Asaf Shapira ¤ Raphael Yustery Abstract It is well-known that, of all graphs with edge-density p, the random graph G(n; p) contains the smallest density of copies of Kt;t, the complete bipartite graph of size 2t. Since Kt;t is a t-blowup of an edge, the following intriguing open question arises: Is it true that of all graphs with triangle 3 density p , the random graph G(n; p) contains close to the smallest density of Kt;t;t, which is the t-blowup of a triangle? Our main result gives an indication that the answer to the above question is positive by showing that for some blowup, the answer must be positive. More formally we prove that if G 3 has triangle density p , then there is some 2 · t · T (p) for which the density of Kt;t;t in G is at (3+o(1))t2 least p , which (up to the o(1) term) equals the density of Kt;t;t in G(n; p). We also raise several open problems related to these problems and discuss some applications to other areas. 1 Introduction One of the main family of problems studied in extremal graph theory is how does the lack and/or number of copies of one graph H in a graph G a®ect the lack and/or number of copies of another graph H0 in G. Perhaps the most well known problems of this type are Ramsey's Theorem and Tur¶an'sTheorem.
  • Closest 4-Leaf Power Is Fixed-Parameter Tractable$

    Closest 4-Leaf Power Is Fixed-Parameter Tractable$

    Discrete Applied Mathematics 156 (2008) 3345–3361 www.elsevier.com/locate/dam Closest 4-leaf power is fixed-parameter tractableI Michael Dom∗, Jiong Guo, Falk Huffner,¨ Rolf Niedermeier Institut fur¨ Informatik, Friedrich-Schiller-Universitat¨ Jena, Ernst-Abbe-Platz 2, D-07743 Jena, Germany Received 3 August 2006; received in revised form 18 December 2007; accepted 9 January 2008 Available online 4 March 2008 Abstract The NP-complete CLOSEST 4-LEAF POWER problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf power. Herein, a 4-leaf power is a graph that can be constructed by considering an unrooted tree—the 4-leaf root—with leaves one-to-one labeled by the graph vertices, where we connect two graph vertices by an edge iff their corresponding leaves are at distance at most 4 in the tree. Complementing previous work on CLOSEST 2-LEAF POWER and CLOSEST 3-LEAF POWER, we give the first algorithmic result for CLOSEST 4-LEAF POWER, showing that CLOSEST 4-LEAF POWER is fixed-parameter tractable with respect to the parameter r. c 2008 Elsevier B.V. All rights reserved. Keywords: Fixed-parameter tractability; Graph algorithm; Graph modification; Graph power; Leaf power; Forbidden subgraph characterization 1. Introduction Graph powers form a classical concept in graph theory, and the rich literature dates back to the sixties of the previous century (see [5, Section 10.6] and [27] for surveys). The k-power of an undirected graph G D .V; E/ is the undirected graph Gk D .V; E0/ with .u; v/ 2 E0 iff there is a path of length at most k between u and v in G.
  • OPTIMAL SOLUTIONS and RANKS in the MAX-CUT SDP Daniel

    OPTIMAL SOLUTIONS and RANKS in the MAX-CUT SDP Daniel

    COVER PAGE: OPTIMAL SOLUTIONS AND RANKS IN THE MAX-CUT SDP Daniel Hong, Skyline High School, Sammamish, WA, USA Hyunwoo Lee, Interlake High School, Bellevue, WA, USA Alex Wei, Interlake High School, Bellevue, WA, USA Instructor: Diego Cifuentes, Massachusetts Institute of Technology, Cam- bridge, MA, USA 1 OPTIMAL SOLUTIONS AND RANKS IN THE MAX-CUT SDP DANIEL HONG, HYUNWOO LEE, AND ALEX WEI Abstract. The max-cut problem is a classical graph theory problem which is NP-complete. The best polynomial time approximation scheme relies on semidefinite programming (SDP). We study the conditions under which graphs of certain classes have rank 1 solutions to the max-cut SDP. We apply these findings to look at how solutions to the max-cut SDP behave under simple combinatorial constructions. Our results determine when solutions to the max-cut SDP for cycle graphs is rank 1. We find the solutions to the max-cut SDP of the vertex sum of two graphs. We then characterize the SDP solutions upon joining two triangle graphs by an edge sum. Keywords: Max-cut, Semidefinite program, Rank, Cycle graphs, Ver- tex sum, Edge sum Contents 1. Introduction 2 Related work 3 Structure 3 2. Background 4 2.1. Semidefinite programs 4 2.2. Max-cut SDP 4 2.3. Clique sums of graphs 6 3. Experiments on rank of max-cut SDP 6 4. Solutions and Ranks for Particular Classes of Graphs 7 4.1. Rank 1 solutions for cycles 7 4.2. Max-cut SDP for a vertex sum 8 4.3. Max-cut SDP for a diamond graph 9 5.
  • Math.RA] 25 Sep 2013 Previous Paper [3], Also Relying in Conceptually Separated Tools from Them, Such As Graphs and Digraphs

    Math.RA] 25 Sep 2013 Previous Paper [3], Also Relying in Conceptually Separated Tools from Them, Such As Graphs and Digraphs

    Certain particular families of graphicable algebras Juan Núñez, María Luisa Rodríguez-Arévalo and María Trinidad Villar Dpto. Geometría y Topología. Facultad de Matemáticas. Universidad de Sevilla. Apdo. 1160. 41080-Sevilla, Spain. [email protected] [email protected] [email protected] Abstract In this paper, we introduce some particular families of graphicable algebras obtained by following a relatively new line of research, ini- tiated previously by some of the authors. It consists of the use of certain objects of Discrete Mathematics, mainly graphs and digraphs, to facilitate the study of graphicable algebras, which are a subset of evolution algebras. 2010 Mathematics Subject Classification: 17D99; 05C20; 05C50. Keywords: Graphicable algebras; evolution algebras; graphs. Introduction The main goal of this paper is to advance in the research of a novel mathematical topic emerged not long ago, the evolution algebras in general, and the graphicable algebras (a subset of them) in particular, in order to obtain new results starting from those by Tian (see [4, 5]) and others already obtained by some of us in a arXiv:1309.6469v1 [math.RA] 25 Sep 2013 previous paper [3], also relying in conceptually separated tools from them, such as graphs and digraphs. Concretely, our goal is to find some particular types of graphicable algebras associated with well-known types of graphs. The motivation to deal with evolution algebras in general and graphicable al- gebras in particular is due to the fact that at present, the study of these algebras is very booming, due to the numerous connections between them and many other branches of Mathematics, such as Graph Theory, Group Theory, Markov pro- cesses, dynamic systems and the Theory of Knots, among others.
  • Graph Powers: Hardness Results, Good Characterizations and Efficient Algorithms

    Graph Powers: Hardness Results, Good Characterizations and Efficient Algorithms

    Graph Powers: Hardness Results, Good Characterizations and Efficient Algorithms Dissertation zur Erlangung des akademischen Grades Doktor-Ingenieur (Dr.-Ing.) der Fakult¨at f¨ur Informatik und Elektrotechnik der Universit¨at Rostock Vorgelegt von MSc. Ngoc Tuy Nguyen Rostock, November 2009 Gutachter: Prof. Dr. Van Bang Le Universit¨at Rostock. Institut fu¨rInformatik Gutachter: Prof. Dr. Egon Wanke Heinrich- Heine- Universit¨at D¨usseldorf. Institut fu¨rInformatik Gutachter: Prof. Dr. Ekkehard K¨ohler Brandenburgische Technische Universit¨at Cottbus. Institut fu¨rMathematik Tag der ¨offentlichen Verteidigung: 30. Oktober 2009 ii Abstract Given a graph H =(VH , EH ) and a positive integer k, the k-th power of H, written Hk, is the graph obtained from H by adding new edges between any pair of vertices k at distance at most k in H; formally, H =(VH , {xy | 1 ≤ dH (x, y) ≤ k}). A graph G is the k-th power of a graph H if G = Hk, and in this case, H is a k-th root of G. For the cases of k = 2 and k = 3, we say that H2 and H3 is the square, respectively, the cube of H and H is a square root of G = H2, respectively, a cube root of G = H3. In this thesis we study the computational complexity for recognizing k-th pow- ers of general graphs as well as restricted graphs. This work provides new NP- completeness results, good characterizations and efficient algorithms for graph pow- ers. The main results are the following. • There exist reductions proving the NP-completeness for recognizing k-th pow- ers of general graphs for fixed k ≥ 2, recognizing k-th powers of bipartite graphs for fixed k ≥ 3, recognizing k-th powers of chordal graphs, and finding k-th roots of chordal graphs for all fixed k ≥ 2.
  • Recognition of C4-Free and 1/2-Hyperbolic Graphs David Coudert, Guillaume Ducoffe

    Recognition of C4-Free and 1/2-Hyperbolic Graphs David Coudert, Guillaume Ducoffe

    Recognition of C4-free and 1/2-hyperbolic graphs David Coudert, Guillaume Ducoffe To cite this version: David Coudert, Guillaume Ducoffe. Recognition of C4-free and 1/2-hyperbolic graphs. SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2014, 28 (3), pp.1601-1617. 10.1137/140954787. hal-01070768 HAL Id: hal-01070768 https://hal.inria.fr/hal-01070768 Submitted on 2 Oct 2014 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. ∗ Recognition of C4-free and 1/2-hyperbolic graphs David Coudert†‡ Guillaume Ducoffe†‡§ October 2, 2014 Abstract The shortest-path metric d of a connected graph G is 1/2-hyperbolic if, and only if, it satisfies d(u,v) + d(x,y) ≤ max{d(u,x) + d(v,y), d(u,y) + d(v,x)} + 1, for every 4-tuple u,x,v,y of G. We show that the problem of deciding whether an unweighted graph is 1/2-hyperbolic is subcubic equivalent to the problem of determining whether there is a chordless cycle of length 4 in a graph. An improved algorithm is also given for both problems, taking advantage of fast rectangular matrix multiplication.
  • Global Discharging Methods for Coloring Problems in Graphs Marthe Bonamy

    Global Discharging Methods for Coloring Problems in Graphs Marthe Bonamy

    Global discharging methods for coloring problems in graphs Marthe Bonamy To cite this version: Marthe Bonamy. Global discharging methods for coloring problems in graphs. Discrete Mathematics [cs.DM]. Université de Montpellier, 2015. English. tel-02083632 HAL Id: tel-02083632 https://tel.archives-ouvertes.fr/tel-02083632 Submitted on 29 Mar 2019 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. Délivré par l’Université Montpellier Préparée au sein de l’école doctorale I2S Et de l’unité de recherche LIRMM Spécialité: INFORMATIQUE Présentée par Marthe Bonamy Global discharging methods for coloring problems in graphs Soutenue le 9 Février 2015 devant le jury composé de Rapporteur Maria CHUDNOVSKY, Professeur, Columbia University (Absente excusée) Roland DUCOURNAU, Professeur, UM2, LIRMM Examinateur Cyril GAVOILLE, Professeur, Université de Bordeaux, LaBRI Examinateur Frédéric HAVET, Directeur de Recherche, CNRS, I3S Rapporteur Dan KRÁL’, Professeur, Warwick University Rapporteur Benjamin LÉVÊQUE, Chargé de Recherche, CNRS, LIRMM Directeur Alexandre PINLOU, Maître de Conférences, UM3, LIRMM Directeur Présidé par Frédéric HAVET. Contents Quelques mots de français 5 Introduction 10 A few words on graph coloring . 11 Global picture . 13 1 Preliminaries 15 1.1 Basic introduction to graphs and coloring .
  • Interlace Polynomials of Friendship Graphs

    Interlace Polynomials of Friendship Graphs

    Electronic Journal of Graph Theory and Applications 6 (2) (2018), 269–281 Interlace polynomials of friendship graphs Christina Eubanks-Turnera, Aihua Lib aDepartment of Mathematics, Loyola Marymount University, 90045 bDepartment of Mathematical Sciences, Montclair State University, 07043 [email protected], [email protected] Abstract In this paper, we study the interlace polynomials of friendship graphs, that is, graphs that satisfy the Friendship Theorem given by Erdos,¨ Renyi´ and Sos. Explicit formulas, special values, and behaviour of coefficients of these polynomials are provided. We also give the interlace polynomials of other similar graphs, such as, the butterfly graph. Keywords: graph polynomial, interlace polynomial, friendship graph, butterfly graph Mathematics Subject Classification : 05C31, 05C50 DOI: 10.5614/ejgta.2018.6.2.7 1. Introduction Sequencing by hybridization is a method of reconstructing a long DNA string from its nu- cleotide sequence. Since gaining a unique reconstruction from the substrings is not always possi- ble, a major question that arises in this study is “For a random string, how many reconstructions are possible?” In [2], Arratia, Bollobas,´ Coppersmith, and Sorkin answer an important question related to DNA sequencing by converting this to a question about Euler circuits in a 2-in, 2-out graph that have been “toggled” (interlaced). The previously mentioned authors introduced the in- terlace polynomial of a graph, a polynomial that represents the information gained from doing the toggling process on the graph, see [2]. Interlace polynomials are similar to other graph polynomi- als, such as, Tutte and Martin polynomials, see [5]. Some researchers have studied different types of graph polynomials, such as genus polynomials, [7].
  • Minor-Obstructions for Apex Sub-Unicyclic Graphs1

    Minor-Obstructions for Apex Sub-Unicyclic Graphs1

    Minor-Obstructions for Apex Sub-unicyclic Graphs1 Alexandros Leivaditis2 Alexandros Singh3 Giannos Stamoulis3 Dimitrios M. Thilikos4,2,3,5 Konstantinos Tsatsanis3 Vasiliki Velona6,7,8 Abstract A graph is sub-unicyclic if it contains at most one cycle. We also say that a graph G is k-apex sub-unicyclic if it can become sub-unicyclic by removing k of its vertices. We identify 29 graphs that are the minor-obstructions of the class of 1-apex sub-unicyclic graphs, i.e., the set of all minor minimal graphs that do not belong in this class. For bigger values of k, we give an exact structural characterization of all the cactus graphs that are minor-obstructions of k-apex sub- unicyclic graphs and we enumerate them. This implies that, for every k, the class of k-apex sub-unicyclic graphs has at least 0.34 · k−2.5(6.278)k minor-obstructions. Keywords: Graph Minors, Obstruction set, Sub-unicyclc graphs. 1 Introduction A graph is called unicyclic [17] if it contains exactly one cycle and is called sub-unicyclic if it contains at most one cycle. Notice that sub-unicyclic graphs are exactly the subgraphs of unicyclic graphs. A graph H is a minor of a graph G if a graph isomorphic to H can be obtained by some subgraph of G after a series of contractions. We say that a graph class G is minor-closed if every minor of every graph in G also belongs in G. We also define obs(G), called the minor-obstruction set of G, as the set of minor-minimal graphs not in G.
  • 4-Prime Cordiality of Some Cycle Related Graphs

    4-Prime Cordiality of Some Cycle Related Graphs

    Available at Applications and Applied http://pvamu.edu/aam Mathematics: Appl. Appl. Math. An International Journal ISSN: 1932-9466 (AAM) Vol. 12, Issue 1 (June 2017), pp. 230 – 240 4-Prime cordiality of some cycle related graphs 1R. Ponraj, 2Rajpal Singh, & 1S. Sathish Narayanan 1Department of Mathematics Sri Paramakalyani College Alwarkurichi-627412, India [email protected]; [email protected] & 2Research Scholar Department of Mathematics Manonmaniam Sundaranar University Abishekapatti, Tirunelveli - 627012, Tamilnadu, India [email protected] Received: June 18, 201; Accepted: October 20, 2016 Abstract Recently three prime cordial labeling behavior of path, cycle, complete graph, wheel, comb, subdivison of a star, bistar, double comb, corona of tree with a vertex, crown, olive tree and other standard graphs were studied. Also four prime cordial labeling behavior of complete graph, book, flower were studied. In this paper, we investigate the four prime cordial labeling behavior of corona of wheel, gear, double cone, helm, closed helm, butterfly graph, and friendship graph. Keywords: Wheel; Gear; Double Cone; Helm; Butterfly Graph MSC 2010 No.: Primary 05C78, Secondary 05C38 1. Introduction Throughout this paper we have considered only simple and undirected graph. Terms and defini- tions not defined here are used in the sense of Harary (2001) and Gallian (2015). 230 AAM: Intern. J., Vol. 12, Issue 1 (June 2017) 231 Let G = (V;E) be a (p;q) graph. The cardinality of V is called the order of G and the cardinality of E is called the size of G. Rosa (1967) introduced graceful labelling of graphs which was the foundation of the graph labelling.
  • Mim-Width III. Graph Powers and Generalized Distance Domination Problems∗

    Mim-Width III. Graph Powers and Generalized Distance Domination Problems∗

    Mim-Width III. Graph Powers and Generalized Distance Domination Problems∗ Lars Jaffkey1, O-joung Kwonz2,3, Torstein J. F. Strømme1, and Jan Arne Telle1 1Department of Informatics, University of Bergen, Norway. flars.jaffke, torstein.stromme, [email protected] 2Department of Mathematics, Incheon National University, South Korea. 3Discrete Mathematics Group, Institute for Basic Science (IBS), Daejeon, South Korea. [email protected] September 4, 2019 Abstract We generalize the family of (σ; ρ) problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as Distance-r Dominating Set and Distance-r Independent Set. We show that these distance problems are in XP parameterized by the structural parameter mim-width, and hence polynomial-time solvable on graph classes where mim-width is bounded and quickly computable, such as k- trapezoid graphs, Dilworth k-graphs, (circular) permutation graphs, interval graphs and their complements, convex graphs and their complements, k-polygon graphs, circular arc graphs, complements of d-degenerate graphs, and H-graphs if given an H-representation. We obtain these results by showing that taking any power of a graph never increases its mim-width by more than a factor of two. To supplement these findings, we show that many classes of (σ; ρ) problems are W[1]-hard parameterized by mim-width + solution size. We show that powers of graphs of tree-width w − 1 or path-width w and powers of graphs of clique-width w have mim-width at most w. These results provide new classes of bounded mim-width. We prove a slight strengthening of the first statement which implies that, surprisingly, Leaf Power graphs which are of importance in the field of phylogenetic studies have mim-width at most 1.
  • Parameterized Leaf Power Recognition Via Embedding Into Graph Products

    Parameterized Leaf Power Recognition Via Embedding Into Graph Products

    Parameterized Leaf Power Recognition via Embedding into Graph Products David Eppstein1 Computer Science Department, University of California, Irvine, USA [email protected] Elham Havvaei Computer Science Department, University of California, Irvine, USA [email protected] Abstract The k-leaf power graph G of a tree T is a graph whose vertices are the leaves of T and whose edges connect pairs of leaves at unweighted distance at most k in T . Recognition of the k-leaf power graphs for k ≥ 7 is still an open problem. In this paper, we provide two algorithms for this problem for sparse leaf power graphs. Our results shows that the problem of recognizing these graphs is fixed-parameter tractable when parameterized both by k and by the degeneracy of the given graph. To prove this, we first describe how to embed a leaf root of a leaf power graph into a product of the graph with a cycle graph. We bound the treewidth of the resulting product in terms of k and the degeneracy of G. The first presented algorithm uses methods based on monadic second-order logic (MSO2) to recognize the existence of a leaf power as a subgraph of the graph product. Using the same embedding in the graph product, the second algorithm presents a dynamic programming approach to solve the problem and provide a better dependence on the parameters. Keywords and phrases leaf power, phylogenetic tree, monadic second-order logic, Courcelle’s theorem, strong product of graphs, fixed-parameter tractability, dynamic programming, tree decomposition 1 Introduction Leaf powers are a class of graphs that were introduced in 2002 by Nishimura, Ragde and Thilikos [41], extending the notion of graph powers.