The NP-Hardness of the Connected p-median Problem on Bipartite Graphs and Split Graphs
|
|
- Albert Gray
- 5 years ago
- Views:
Transcription
1 Chiang Mai J. Sci. 2013; 40(1) 8 3 Chiang Mai J. Sci. 2013; 40(1) : Contributed Paper The NP-Hardness of the Connected p-median Problem on Bipartite Graphs and Split Graphs Shun-Chieh Chang [a] William Chung-Kung Yen*[b] Yue-Li Wang [a] and Jia-Jie Liu [b] [a] Department of Information Management National Taiwan University of Science and Technology Taipei Taiwan. [b] Department of Information Management Shih Hsin University Taipei Taiwan. *Author for correspondence; ckyen001@ms7.hinet.net Received: 28 June 2011 Accepted: 29 April 2012 ABSTRACT In this paper we study a variant of the p-median problem on graphs in which the subgraph induced by the p-median is asked to be connected and this problem is called the connected p-median problem. We show that the connected p-median problem is NP-hard on bipartite graphs and split graphs respectively. Keywords: Connected p-median NP-hard bipartite graph split graph 1. INTRODUCTION Let G(V E l w) be a connected graph in which every vertex v (respectively edge e) is associateith a positive weight w(v) (respectively l(e)) where V(G) and E(G) are the vertex-set and edge-set of G respectively. When the context is clear we simply write V and E rather than V(G) and E(G) respectively. The length of a path is the summation of the weights of all edges in the path. The distance between two vertices u and v denoted as d(u v) is the length of any shortest path from u to v. The weighted distance between u and v denoted as (u v) is defined as w(u)* d(u v). The weighted distance between a vertex u and a nonempty proper subset Q of V denoted as (u Q) is equal to min{ (u v) v Q} [5]. For brevity we use D(G Q) to stand for the value of u (V\Q) (u Q). If <Q> is asked to be connected then D(G Q) is written as (G Q) where <Q> denotes the subgraph induced by the vertices in Q. The connected p-median problem abbreviated as the CpM problem is to identify a connected subset Q of V with p vertices called a connected p-median such that (G Q) is minimized among all connected p-medians. The CpM problem was defined by Vieira [6] and independently by Chen Ding and Li [1]. In [6] Vieira developed approximation algorithms for solving the CpM problem. In [1] Chen et al. proposed an algorithm for solving the CpM problem on trees in O(pn) time where n is the number of the vertices in a tree. Later they also gave an O(pn)-time algorithm for solving the CpM problem on 3-cactus
2 8 4 Chiang Mai J. Sci. 2013; 40(1) graphs [2]. In [7] Yen Chang Yang and Hu proved that the CpM problem is NP-hard on complete graphs with w(v) = 1 and l(e) {1 2} for all v V and e E. In this paper we shall show that the CpM problem is NPhard on bipartite graphs and split graphs respectively. The rest of this paper is organized as follows. In Section 2 we prove the NPhardness of the CpM problem on bipartite graphs. In Section 3 we show that the CpM problem is NP-hard on split graphs. Finally the concluding remarks are given in Section THE NP-HARDNESS OF THE PROBLEM ON BIPARTITE GRAPHS Given a graph G(V E) a subset Q of V is called an independent set if there is no edge between any pair of vertices in Q. A graph G is called a bipartite graph if V can be partitioned into two nonempty independent sets. We consider the following decision problem corresponding to the CpM problem. The CpM decision problem: Given a graph G(V E l w) a positive integer p and a positive constant determine whether there exists a connected p-median Q such that (G Q) =. We shall show that the exact cover by 3-sets problem [3] can be reduced to the CpM decision problem on bipartite graphs. The definition of the exact cover by 3-sets problem is described as follows. Suppose that X is a set with 3q elements q 1 and S is a collection of 3-element subsets of X. A subset C of S is called an exact cover of X if every element of X occurs in exactly one member of C. The exact cover by 3-sets problem abbreviated as the X3C problem is to determine whether there exists an exact cover with respect to X and S. Theorem 2.1. The CpM decision problem on bipartite graphs G with l(e) = w(v) = 1 for all e E and v V is NP-complete. Proof. Let X = {x 1 x 3q } and s ={s 1 s 2 s h } be an instance of the X3C problem. We construct a bipartite graph G(V E l w) with respect to X and S as follows. Let x 0 be a vertex in V and furthermore for each element x X S create a corresponding vertex with label x in V. Let E = {(s j x) x s j 1 j h} {(x 0 s j ) 1 j h} and l(e) = w(v) = 1 for all e E and v V (see Figure 1 for an illustration). For simplicity V is also denoted by S X {x 0 } when no confusion arises. In the following we show that there is a connected p-median Q in G with (G Q) = if and only if S contains an exact cover of X where p = q + 1 and = 2q + h. First we show that if S contains an exact cover of X then there is a connected p-median Q in G with (G Q) =. Without loss of generality we can assume that the set {s 1 s 2 s q } is an exact cover if it exists of X. Let Q = {x 0 s 2 s q }. Clearly by the construction of G <Q> must be connected. We can also find that (v Q) = 1 for every vertex v V \ Q. This implies that (G Q) = 3q + (h q) = 2q + h =. Now we prove another direction. Let Q = Q 0 Q S Q X be a connected p-median set with p = q + 1 where Q S S Q X X and Q 0 is either the set {x 0 } or an empty set. Clearly Q S contains at most q vertices since all vertices in S are in the same partite set. Assume that Q X = k and X\Q X = 3q k. We claim that Q 0 = {x 0 } and Q X = i.e. Q X is an empty set. Suppose to the contrary that Q 0 = or Q X. For former case i.e. Q 0 = Q S = (q + 1) k. The number of vertices in X \ Q X which are not adjacent to any vertex
3 Chiang Mai J. Sci. 2013; 40(1) 8 5 in Q S is at least ( X Q X ) (3 Q S Q X ) = 3k 3. The term X Q X in the first parentheses pair of the equality indicates the number of vertices in X which are not in Q while the term 3 Q S Q X in the second parentheses pair indicates the maximum number of vertices in X \ Q X which can be adjacent to Q S. Note that if Q S = q namely k = 1 then 3k 3 = 0. However since the set containing all corresponding elements of Q S in S is not an exact cover there exists at least one vertex in X \ Q X which is not adjacent to any vertex in Q S. Thus the number of vertices in X \ Q X which are not adjacent to any vertex in Q S is at least max {3k 3 1}. Accordingly we can find (G Q) > from the following derivation. (G Q) = (x 0 Q)+ d (s Q)+ d (x Q) si (S\Q S ) w i x i (X\Q X ) w i 1 + (h (q + 1 k)) + d (x Q) xi (X\Q X ) w i h q + k + (3q k + max{3k 3 1}) = h + 2q + max{3k 3 1} > This implies that Q 0 must be equal to {x 0 } if there is a connected p-median set with p = q + 1 and (G Q) =. For later case i.e. Q X we can find that Q 0 = 1 and Q S = q k. Thus there are 3q k vertices in X \ Q X which are not in Q. Moreover there are at most 3(q k) vertices in X \ Q X which can be adjacent to Q S. Thus there are at least 3q k 3(q k) = 2k vertices say v in X \Q X with (v Q) = 2. By the following derivation we can find that there is no connected p-median Q p = q + 1 satisfying (G Q) = in this case. (G Q)= d (s Q)+ d (x Q) si (S\Q S ) w i x i (X\Q X ) w i = h (q k) + d (x Q) xi (X\Q X ) w i h q + k + 3q k + 2k = h + 2q +2k > Thus our claim holds and Q = Q 0 Q S with Q 0 = {x 0 } and Q S = q. Since all vertices in S \ Q S are adjacent to x 0 (G Q) = d ( Q)+ d ( (S\Qs ) w X w Q)=h q+ X ( Q). After setting (G Q) = 2q + h this yields X ( Q) = 3q. This implies that every vertex in X is adjacent to exactly one vertex in Q S and the subset of S containing the elements corresponding to Q S is an exact cover of X. This concludes the proof of this theorem. We use an example to elucidate Theorem 2.1. Consider the instance for the X3C problem having X = {x 1 x 9 } and S = {s 1 s 2 s 5 } i.e. q = 3 and h = 5 in which s 1 = {x 1 x 3 } s 2 = {x 4 x 5 x 6 } s 3 = {x 7 x 8 x 9 } s 4 = {x 1 x 5 x 9 } and s 5 ={x 4 x 6 x 7 }. Thus there are 3q + h + 1 = 15
4 8 6 Chiang Mai J. Sci. 2013; 40(1) vertices in V and (3 + 1) * h = 4 * 5 = 20 edges in E. Figure 1 depicts the corresponding bipartite graph G. We can find that Q = Q 0 Q S with ={x 0 } and Q S = {s 1 s 2 s 3 } is a connected 4-median of G satisfying (G Q) = = h + 2q = 11. Furthermore the subset {s 1 s 2 s 3 } of S corresponding to Q S is an exact cover of X. Figure 1. The bipartite graph G constructed from the X3C problem with X = {x 1 x 9 } and S = {s 1 s 2 s 5 }. Corollary 2.2 The CpM problem on bipartite graphs G with w(e) = w(v) = 1 for all e E and v V is NP-hard. 3. THE NP-HARDNESS OF THE PROBLEM ON SPLIT GRAPHS A graph G = (V E) is a split graph if V can be partitioned into I and C such that I is an independent set and C is a clique [4]. In the following we show that the CpM problem on split graphs is NP-hard. This objective is achieved also via reducing the X3C problem to the CpM decision problem. Theorem 3.1 The CpM decision problem on split graphs with l(e) = w(v) = 1 for all e E and v V is NP-complete. Proof. Let X = {x 1 x 3q } and S = {s 1 s 2 s h } be an instance of the X3C problem. We construct a split graph G(V E l w) with respect to X and S as follows. For each element x X S create a corresponding vertex with label x in V. Let E = {(s j x) x s j 1 j h} {(s i s j ) 1 i j h} and l(e) = w(v) = 1 for all e E and v V (see Figure 2 for an illustration). For simplicity V is also denoted by S X when no confusion arises. In the following we show that there exists a connected p-median Q in G with (G Q) = if and only if S contains an exact cover of X where p = q and = h + 2q. First we show that if S contains an exact cover of X then there is a connected p- median Q in G with (G Q) =. Without loss of generality we can assume that the set {s 1 s 2 s q } is an exact cover if it exists of X. Let Q = {s 1 s 2 s q }. Clearly by the construction of G <Q> must be connected. We can also find that (v Q) = 1 for every vertex v V \ Q. This implies that (G Q) = 3q + (h q) = 2q + h =.
5 Chiang Mai J. Sci. 2013; 40(1) 8 7 Now we prove another direction. Let Q = Q S Q X be a connected q-median set where Q S S and Q X X. Assume that Q X = k and X \ Q X = 3q k. We claim that Q X =. Suppose to the contrary that Q X. Since Q is connected every vertex in Q X is adjacent to some vertex in Q S. Thus there are at most 3 Q S Q X vertices in X\Q X adjacent to some vertex in Q S. Consequently there are at least X\Q X (3 Q S - Q X )=(3q-k)-(3(q-k)-k) =3k vertices in X \ Q X which are not adjacent to any vertex in Q S. This means that (v Q)=2 for those vertices v X\Q X which are not adjacent to any vertex in Q S. By the assumption that k 1 we can have the following derivation. (GQ) = d (s Q)+ d (x Q) si (S\Q s ) w i x i (X\Q x ) w i = h (q k) + d (x Q) xi (X\Q x ) w i h (q k) + 3q k + 3k = h + 2q +k > This contradicts to the assumption that (GQ) =. Therefore Q S = q and (GQ) = d (s Q) + d (x Q) si (S\Q s ) w i x i (X\Q x ) w i = h q + d (x Q) xi (X\Q x ) w i After setting (G Q) = h + 2q we obtain that d (x xi Q) = 3q. This implies (X\Q x ) w i that every vertex in X is adjacent to exactly one vertex in Q S and the subset of S containing the elements corresponding to Q S is an exact cover of X. This establishes this theorem. Figure 2 is the split graph constructed from the X3C problem with X = {x 1 x 9 } and S = {s 1 s 2 s 5 }. It is easy to check that Q S = {s 1 s 2 s 3 } is a connected 3-median set of the graph with (G Q) = h + 2q = 11 and {s 1 s 2 s 3 } is an exact cover of X. Figure 2. The split graph G constructed from the X3C problem with X = {x 1 x 9 } and S = {s 1 s 2 s 5 }. Corollary 3.2 The CpM problem on split graphs with l(e) = w(v) = 1 for all e E and v V is NP-hard.
6 8 8 Chiang Mai J. Sci. 2013; 40(1) 4. CONCLUDING REMARKS In this paper we study the CpM problem on graphs which is a new variant of the essential p-median problem. We showed that the CpM problem is NP-hard on bipartite graphs and split graphs respectively. In the future it is worth to investigate the NP-hardness of the CpM problem on other classes of graphs and to find algorithms for solving the CpM problem on some special classes of graphs. For examples the class of threshold graphs is an important subset of the class of split graphs. Furthermore the class of chordal bipartite graphs is between the classes of bipartite graphs and trees. Note that there exist polynomial-time algorithms for solving the CpM problem on trees. Applying the results of this paper it is desirable to find out if there exist polynomial-time algorithms for solving the CpM problem on those two classes of graphs. ACKNOWLEDGEMENT This work was supported in part by the National Science Council Taiwan under the contract numbers NSC E and NSC E REFERENCES [1] Chen G.-T. Ding W. and Li S.-W. Connected p-median problems in tree networks J. Hangzhou Dianzi Univ. 2009; 29(2): [2] Chen G.-T. Xin S. and Cui S.-H. The connected p-median problem on the 3-cactus graph J. Hangzhou Dianzi Univ. 2010; 30(2): [3] Garey M.R. and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness Bell Laboratories Murray Hill Freeman & Co. N.J [4] Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs Second Edition Elsevier [5] Kariv O. and Hakimi S.L. An algorithmic approach to network location problems. II: the p-medians SIAM. J. Appl. Math. 1979; 37: [6] Vieira C. E. C. Heuristics for the Connected p-median Problem Ph.D. Thesis Pontif1 cia Universidade Cato lica do Rio de Janeiro [7] Yen W.C.-K. Chang S.-C. Yang S.C.-S. and Hu S.-C. The connected p-median problem on graphs with forbidden vertices in Proceedings of 27 th Workshop on Combinatorial Mathematics and Computation Theory Providence University Taichung Taiwan 2010;
EXACT DOUBLE DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 25 (2005 ) 291 302 EXACT DOUBLE DOMINATION IN GRAPHS Mustapha Chellali Department of Mathematics, University of Blida B.P. 270, Blida, Algeria e-mail: mchellali@hotmail.com
More informationExtremal Graphs Having No Stable Cutsets
Extremal Graphs Having No Stable Cutsets Van Bang Le Institut für Informatik Universität Rostock Rostock, Germany le@informatik.uni-rostock.de Florian Pfender Department of Mathematics and Statistics University
More informationIndependent Transversal Dominating Sets in Graphs: Complexity and Structural Properties
Filomat 30:2 (2016), 293 303 DOI 10.2298/FIL1602293A Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Independent Transversal Dominating
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationF. Roussel, I. Rusu. Université d Orléans, L.I.F.O., B.P. 6759, Orléans Cedex 2, France
A linear algorithm to color i-triangulated graphs F. Roussel, I. Rusu Université d Orléans, L.I.F.O., B.P. 6759, 45067 Orléans Cedex 2, France Abstract: We show that i-triangulated graphs can be colored
More informationHong-Gwa Yeh and Gerard J. Chang. 1. Introduction
TAIWANESE JOURNAL OF MATHEMATICS Vol. 2, No. 3, pp. 353-360, September 1998 THE PATH-PARTITION PROBLEM IN BIPARTITE DISTANCE-HEREDITARY GRAPHS Hong-Gwa Yeh and Gerard J. Chang Abstract. A path partition
More informationComplexity of conditional colorability of graphs
Complexity of conditional colorability of graphs Xueliang Li 1, Xiangmei Yao 1, Wenli Zhou 1 and Hajo Broersma 2 1 Center for Combinatorics and LPMC-TJKLC, Nankai University Tianjin 300071, P.R. China.
More informationGearing optimization
Gearing optimization V.V. Lozin Abstract We consider an optimization problem that arises in machine-tool design. It deals with optimization of the structure of gearbox, which is normally represented by
More informationEnumerating minimal connected dominating sets in graphs of bounded chordality,
Enumerating minimal connected dominating sets in graphs of bounded chordality, Petr A. Golovach a,, Pinar Heggernes a, Dieter Kratsch b a Department of Informatics, University of Bergen, N-5020 Bergen,
More informationCluster Graph Modification Problems
Cluster Graph Modification Problems Ron Shamir Roded Sharan Dekel Tsur December 2002 Abstract In a clustering problem one has to partition a set of elements into homogeneous and well-separated subsets.
More informationOn the S-Labeling problem
On the S-Labeling problem Guillaume Fertin Laboratoire d Informatique de Nantes-Atlantique (LINA), UMR CNRS 6241 Université de Nantes, 2 rue de la Houssinière, 4422 Nantes Cedex - France guillaume.fertin@univ-nantes.fr
More informationSupereulerian planar graphs
Supereulerian planar graphs Hong-Jian Lai and Mingquan Zhan Department of Mathematics West Virginia University, Morgantown, WV 26506, USA Deying Li and Jingzhong Mao Department of Mathematics Central China
More informationThe maximum edge biclique problem is NP-complete
The maximum edge biclique problem is NP-complete René Peeters Department of Econometrics and Operations Research Tilburg University The Netherlands April 5, 005 File No. DA5734 Running head: Maximum edge
More informationEvery line graph of a 4-edge-connected graph is Z 3 -connected
European Journal of Combinatorics 0 (2009) 595 601 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Every line graph of a 4-edge-connected
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 informationThe Complexity of Maximum. Matroid-Greedoid Intersection and. Weighted Greedoid Maximization
Department of Computer Science Series of Publications C Report C-2004-2 The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization Taneli Mielikäinen Esko Ukkonen University
More informationarxiv: v1 [cs.dm] 29 Oct 2012
arxiv:1210.7684v1 [cs.dm] 29 Oct 2012 Square-Root Finding Problem In Graphs, A Complete Dichotomy Theorem. Babak Farzad 1 and Majid Karimi 2 Department of Mathematics Brock University, St. Catharines,
More informationarxiv: v1 [cs.ds] 2 Oct 2018
Contracting to a Longest Path in H-Free Graphs Walter Kern 1 and Daniël Paulusma 2 1 Department of Applied Mathematics, University of Twente, The Netherlands w.kern@twente.nl 2 Department of Computer Science,
More informationKeywords: compositions of integers, graphs, location problems, combinatorial optimization. 1. Introduction and motivation
MINIMUM WEIGHT t-composition OF AN INTEGER DOMINGOS M. CARDOSO (1) AND J. ORESTES CERDEIRA (2), (1) DEPARTAMENTO DE MATEMÁTICA, UNIV. DE AVEIRO, 3810-193 AVEIRO, PORTUGAL (DCARDOSO@MAT.UA.PT) (1) DEPARTAMENTO
More information1.1 P, NP, and NP-complete
CSC5160: Combinatorial Optimization and Approximation Algorithms Topic: Introduction to NP-complete Problems Date: 11/01/2008 Lecturer: Lap Chi Lau Scribe: Jerry Jilin Le This lecture gives a general introduction
More informationChapter 34: NP-Completeness
Graph Algorithms - Spring 2011 Set 17. Lecturer: Huilan Chang Reference: Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms, 2nd Edition, The MIT Press. Chapter 34: NP-Completeness 2. Polynomial-time
More informationDominator Colorings and Safe Clique Partitions
Dominator Colorings and Safe Clique Partitions Ralucca Gera, Craig Rasmussen Naval Postgraduate School Monterey, CA 994, USA {rgera,ras}@npsedu and Steve Horton United States Military Academy West Point,
More informationAn Ore-type Condition for Cyclability
Europ. J. Combinatorics (2001) 22, 953 960 doi:10.1006/eujc.2001.0517 Available online at http://www.idealibrary.com on An Ore-type Condition for Cyclability YAOJUN CHEN, YUNQING ZHANG AND KEMIN ZHANG
More informationHavel Hakimi residues of unigraphs
Havel Hakimi residues of unigraphs Michael D. Barrus 1 Department of Mathematics, Black Hills State University, Spearfish, SD 57799 Abstract The residue r(g) of a graphgis the number of zerosleft after
More informationOn the Connectivity of a Graph and its Complement Graph
On the Connectivity of a Graph and its Complement Graph Jia De Lin 1, Yue Li Wang 1, Jou Ming Chang 2 and Hung Chang Chan 3 1 Department of Information Management, National Taiwan University of Science
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 informationThe minimum G c cut problem
The minimum G c cut problem Abstract In this paper we define and study the G c -cut problem. Given a complete undirected graph G = (V ; E) with V = n, edge weighted by w(v i, v j ) 0 and an undirected
More informationUNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS
UNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS MARIA CHUDNOVSKY, RINGI KIM, SANG-IL OUM, AND PAUL SEYMOUR Abstract. An n-vertex graph is prime if it has no homogeneous set, that
More informationA MATROID EXTENSION RESULT
A MATROID EXTENSION RESULT JAMES OXLEY Abstract. Adding elements to matroids can be fraught with difficulty. In the Vámos matroid V 8, there are four independent sets X 1, X 2, X 3, and X 4 such that (X
More informationMore on NP and Reductions
Indian Institute of Information Technology Design and Manufacturing, Kancheepuram Chennai 600 127, India An Autonomous Institute under MHRD, Govt of India http://www.iiitdm.ac.in COM 501 Advanced Data
More informationNeighbor Sum Distinguishing Total Colorings of Triangle Free Planar Graphs
Acta Mathematica Sinica, English Series Feb., 2015, Vol. 31, No. 2, pp. 216 224 Published online: January 15, 2015 DOI: 10.1007/s10114-015-4114-y Http://www.ActaMath.com Acta Mathematica Sinica, English
More informationA Linear-Time Algorithm for the Terminal Path Cover Problem in Cographs
A Linear-Time Algorithm for the Terminal Path Cover Problem in Cographs Ruo-Wei Hung Department of Information Management Nan-Kai Institute of Technology, Tsao-Tun, Nantou 54, Taiwan rwhung@nkc.edu.tw
More informationGRAPHS WITH MAXIMAL INDUCED MATCHINGS OF THE SAME SIZE. 1. Introduction
GRAPHS WITH MAXIMAL INDUCED MATCHINGS OF THE SAME SIZE PHILIPPE BAPTISTE, MIKHAIL Y. KOVALYOV, YURY L. ORLOVICH, FRANK WERNER, IGOR E. ZVEROVICH Abstract. A graph is well-indumatched if all its maximal
More informationDiscrete Applied Mathematics. Tighter bounds of the First Fit algorithm for the bin-packing problem
Discrete Applied Mathematics 158 (010) 1668 1675 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Tighter bounds of the First Fit algorithm
More informationChordal Graphs, Interval Graphs, and wqo
Chordal Graphs, Interval Graphs, and wqo Guoli Ding DEPARTMENT OF MATHEMATICS LOUISIANA STATE UNIVERSITY BATON ROUGE, LA 70803-4918 E-mail: ding@math.lsu.edu Received July 29, 1997 Abstract: Let be the
More informationOn Hamiltonian cycles and Hamiltonian paths
Information Processing Letters 94 (2005) 37 41 www.elsevier.com/locate/ipl On Hamiltonian cycles and Hamiltonian paths M. Sohel Rahman a,, M. Kaykobad a,b a Department of Computer Science and Engineering,
More informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More informationP versus NP. Math 40210, Spring September 16, Math (Spring 2012) P versus NP September 16, / 9
P versus NP Math 40210, Spring 2012 September 16, 2012 Math 40210 (Spring 2012) P versus NP September 16, 2012 1 / 9 Properties of graphs A property of a graph is anything that can be described without
More informationA characterization of diameter-2-critical graphs with no antihole of length four
Cent. Eur. J. Math. 10(3) 2012 1125-1132 DOI: 10.2478/s11533-012-0022-x Central European Journal of Mathematics A characterization of diameter-2-critical graphs with no antihole of length four Research
More informationRelating 2-rainbow domination to weak Roman domination
Relating 2-rainbow domination to weak Roman domination José D. Alvarado 1, Simone Dantas 1, and Dieter Rautenbach 2 arxiv:1507.04901v1 [math.co] 17 Jul 2015 1 Instituto de Matemática e Estatística, Universidade
More informationP versus NP. Math 40210, Fall November 10, Math (Fall 2015) P versus NP November 10, / 9
P versus NP Math 40210, Fall 2015 November 10, 2015 Math 40210 (Fall 2015) P versus NP November 10, 2015 1 / 9 Properties of graphs A property of a graph is anything that can be described without referring
More informationProbe interval graphs and probe unit interval graphs on superclasses of cographs
Author manuscript, published in "" Discrete Mathematics and Theoretical Computer Science DMTCS vol. 15:2, 2013, 177 194 Probe interval graphs and probe unit interval graphs on superclasses of cographs
More informationMatchings in hypergraphs of large minimum degree
Matchings in hypergraphs of large minimum degree Daniela Kühn Deryk Osthus Abstract It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains
More informationk-tuple Domatic In Graphs
CJMS. 2(2)(2013), 105-112 Caspian Journal of Mathematical Sciences (CJMS) University of Mazandaran, Iran http://cjms.journals.umz.ac.ir ISSN: 1735-0611 k-tuple Domatic In Graphs Adel P. Kazemi 1 1 Department
More informationClassical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems
Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems Rani M. R, Mohith Jagalmohanan, R. Subashini Binary matrices having simultaneous consecutive
More informationMalaya J. Mat. 2(3)(2014)
Malaya J Mat (3)(04) 80-87 On k-step Hamiltonian Bipartite and Tripartite Graphs Gee-Choon Lau a,, Sin-Min Lee b, Karl Schaffer c and Siu-Ming Tong d a Faculty of Comp & Mathematical Sciences, Universiti
More informationComplexity Results for Equistable Graphs and Related Classes
Complexity Results for Equistable Graphs and Related Classes Martin Milanič James Orlin Gábor Rudolf January 20, 2009 Abstract We describe a simple pseudo-polynomial-time dynamic programming algorithm
More informationGraph homomorphism into an odd cycle
Graph homomorphism into an odd cycle Hong-Jian Lai West Virginia University, Morgantown, WV 26506 EMAIL: hjlai@math.wvu.edu Bolian Liu South China Normal University, Guangzhou, P. R. China EMAIL: liubl@hsut.scun.edu.cn
More informationMAXIMAL VERTEX-CONNECTIVITY OF S n,k
MAXIMAL VERTEX-CONNECTIVITY OF S n,k EDDIE CHENG, WILLIAM A. LINDSEY, AND DANIEL E. STEFFY Abstract. The class of star graphs is a popular topology for interconnection networks. However it has certain
More informationThe Singapore Copyright Act applies to the use of this document.
Title On graphs whose low polynomials have real roots only Author(s) Fengming Dong Source Electronic Journal of Combinatorics, 25(3): P3.26 Published by Electronic Journal of Combinatorics This document
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationNOTES ON THE INDEPENDENCE NUMBER IN THE CARTESIAN PRODUCT OF GRAPHS
Discussiones Mathematicae Graph Theory xx (xxxx ) xxx xxx NOTES ON THE INDEPENDENCE NUMBER IN THE CARTESIAN PRODUCT OF GRAPHS G. Abay-Asmerom, R. Hammack, C.E. Larson and D.T. Taylor Department of Mathematics
More informationThe graph sandwich problem for 1-join composition is NP-complete
Discrete Applied Mathematics 121 (2002) 73 82 The graph sandwich problem for 1-join composition is NP-complete Celina M.H. de Figueiredo a;, Sulamita Klein a, Kristina Vuskovic b a IM and COPPE, Universidade
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Varaporn Saenpholphat; Ping Zhang Connected resolvability of graphs Czechoslovak Mathematical Journal, Vol. 53 (2003), No. 4, 827 840 Persistent URL: http://dml.cz/dmlcz/127843
More informationTHE COMPLEXITY OF DISSOCIATION SET PROBLEMS IN GRAPHS. 1. Introduction
THE COMPLEXITY OF DISSOCIATION SET PROBLEMS IN GRAPHS YURY ORLOVICH, ALEXANDRE DOLGUI, GERD FINKE, VALERY GORDON, FRANK WERNER Abstract. A subset of vertices in a graph is called a dissociation set if
More informationMaximum k-regular induced subgraphs
R u t c o r Research R e p o r t Maximum k-regular induced subgraphs Domingos M. Cardoso a Marcin Kamiński b Vadim Lozin c RRR 3 2006, March 2006 RUTCOR Rutgers Center for Operations Research Rutgers University
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. Boundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Boundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph Hisayuki HARA and Akimichi TAKEMURA METR 2006 41 July 2006 DEPARTMENT
More informationA Note on Roman {2}-domination problem in graphs
A Note on Roman {2}-domination problem in graphs arxiv:1804.09338v3 [math.co] 17 Feb 2019 Hangdi Chen and Changhong Lu School of Mathematical Sciences, Shanghai Key Laboratory of PMMP, East China Normal
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 informationOn disconnected cuts and separators
On disconnected cuts and separators Takehiro Ito 1, Marcin Kamiński 2, Daniël Paulusma 3 and Dimitrios M. Thilikos 4 1 Graduate School of Information Sciences, Tohoku University, Aoba-yama 6-6-05, Sendai,
More informationLinear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs Nathan Lindzey, Ross M. McConnell Colorado State University, Fort Collins CO 80521, USA Abstract. Tucker characterized
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 159 (2011) 1345 1351 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam On disconnected cuts and separators
More informationPerfect divisibility and 2-divisibility
Perfect divisibility and 2-divisibility Maria Chudnovsky Princeton University, Princeton, NJ 08544, USA Vaidy Sivaraman Binghamton University, Binghamton, NY 13902, USA April 20, 2017 Abstract A graph
More informationChoosability on H-Free Graphs
Choosability on H-Free Graphs Petr A. Golovach 1, Pinar Heggernes 1, Pim van t Hof 1, and Daniël Paulusma 2 1 Department of Informatics, University of Bergen, Norway {petr.golovach,pinar.heggernes,pim.vanthof}@ii.uib.no
More informationComplexity Classification of Some Edge Modification Problems
Complexity Classification of Some Edge Modification Problems Assaf Natanzon 1, Ron Shamir 1, and Roded Sharan 1 Department of Computer Science, Tel Aviv University, Tel-Aviv, Israel. fnatanzon,shamir,rodedg@math.tau.ac.il.
More informationA Note on Perfect Partial Elimination
A Note on Perfect Partial Elimination Matthijs Bomhoff, Walter Kern, and Georg Still University of Twente, Faculty of Electrical Engineering, Mathematics and Computer Science, P.O. Box 217, 7500 AE Enschede,
More informationMath 5707: Graph Theory, Spring 2017 Midterm 3
University of Minnesota Math 5707: Graph Theory, Spring 2017 Midterm 3 Nicholas Rancourt (edited by Darij Grinberg) December 25, 2017 1 Exercise 1 1.1 Problem Let G be a connected multigraph. Let x, y,
More informationEquitable list colorings of planar graphs without short cycles
Theoretical Computer Science 407 (008) 1 8 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Equitable list colorings of planar graphs
More informationarxiv: v1 [cs.dm] 26 Apr 2010
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs George B. Mertzios Derek G. Corneil arxiv:1004.4560v1 [cs.dm] 26 Apr 2010 Abstract Given a graph G, the longest path
More informationPartial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs
Partial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs Flavia Bonomo a,1, Maria Chudnovsky b,2 and Guillermo Durán c,3 a Departamento de Matemática, Facultad
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationGRAPH SEARCHING, AND A MIN-MAX THEOREM FOR TREE-WIDTH. P. D. Seymour Bellcore 445 South St. Morristown, New Jersey 07960, USA. and
GRAPH SEARCHING, AND A MIN-MAX THEOREM FOR TREE-WIDTH P. D. Seymour Bellcore 445 South St. Morristown, New Jersey 07960, USA and Robin Thomas* School of Mathematics Georgia Institute of Technology Atlanta,
More informationInduced Subtrees in Interval Graphs
Induced Subtrees in Interval Graphs Pinar Heggernes 1, Pim van t Hof 1, and Martin Milanič 2 1 Department of Informatics, University of Bergen, Norway {pinar.heggernes,pim.vanthof}@ii.uib.no 2 UP IAM and
More informationarxiv: v2 [math.co] 19 Jun 2018
arxiv:1705.06268v2 [math.co] 19 Jun 2018 On the Nonexistence of Some Generalized Folkman Numbers Xiaodong Xu Guangxi Academy of Sciences Nanning 530007, P.R. China xxdmaths@sina.com Meilian Liang School
More informationOn the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Theoretical Computer Science 381 (2007) 57 67 www.elsevier.com/locate/tcs On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs C.M.H. de Figueiredo a,, L.
More informationComputational complexity theory
Computational complexity theory Introduction to computational complexity theory Complexity (computability) theory deals with two aspects: Algorithm s complexity. Problem s complexity. References S. Cook,
More informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
More informationarxiv: v3 [math.co] 19 Sep 2018
Decycling Number of Linear Graphs of Trees arxiv:170101953v3 [mathco] 19 Sep 2018 Jian Wang a, Xirong Xu b, a Department of Mathematics Taiyuan University of Technology, Taiyuan, 030024, PRChina b School
More informationDiscrete Mathematics
Discrete Mathematics 310 (2010) 3398 303 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Maximal cliques in {P 2 P 3, C }-free graphs S.A.
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 434 (2011) 1793 1798 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa A characterization of
More informationAn Improved Algorithm for Parameterized Edge Dominating Set Problem
An Improved Algorithm for Parameterized Edge Dominating Set Problem Ken Iwaide and Hiroshi Nagamochi Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan,
More informationA characterisation of eccentric sequences of maximal outerplanar graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 58(3) (2014), Pages 376 391 A characterisation of eccentric sequences of maximal outerplanar graphs P. Dankelmann Department of Mathematics University of Johannesburg
More informationQuasi-parity and perfect graphs. Irena Rusu. L.R.I., U.R.A. 410 du C.N.R.S., bât. 490, Orsay-cedex, France
Quasi-parity and perfect graphs Irena Rusu L.R.I., U.R.A. 410 du C.N.R.S., bât. 490, 91405 Orsay-cedex, France Abstract In order to prove the Strong Perfect Graph Conjecture, the existence of a simple
More informationOn Dominator Colorings in Graphs
On Dominator Colorings in Graphs Ralucca Michelle Gera Department of Applied Mathematics Naval Postgraduate School Monterey, CA 994, USA ABSTRACT Given a graph G, the dominator coloring problem seeks a
More informationLine Graphs and Forbidden Induced Subgraphs
Line Graphs and Forbidden Induced Subgraphs Hong-Jian Lai and Ľubomír Šoltés Department of Mathematics West Virginia University, Morgantown, WV 26506-6310 July 14, 2002 Abstract Beineke and Robertson independently
More informationThe L(2, 1)-labeling on the skew and converse skew products of graphs
Applied Mathematics Letters 20 (2007) 59 64 www.elsevier.com/locate/aml The L(2, 1)-labeling on the skew and converse skew products of graphs Zhendong Shao a,,rogerk.yeh b, David Zhang c a Department of
More informationUniform Star-factors of Graphs with Girth Three
Uniform Star-factors of Graphs with Girth Three Yunjian Wu 1 and Qinglin Yu 1,2 1 Center for Combinatorics, LPMC Nankai University, Tianjin, 300071, China 2 Department of Mathematics and Statistics Thompson
More informationarxiv: v2 [cs.dm] 2 Feb 2016
The VC-Dimension of Graphs with Respect to k-connected Subgraphs Andrea Munaro Laboratoire G-SCOP, Université Grenoble Alpes arxiv:130.6500v [cs.dm] Feb 016 Abstract We study the VC-dimension of the set
More informationarxiv: v1 [math.co] 13 May 2016
GENERALISED RAMSEY NUMBERS FOR TWO SETS OF CYCLES MIKAEL HANSSON arxiv:1605.04301v1 [math.co] 13 May 2016 Abstract. We determine several generalised Ramsey numbers for two sets Γ 1 and Γ 2 of cycles, in
More informationUniversity of Twente. Faculty of Mathematical Sciences. Toughness and hamiltonicity in k-trees. University for Technical and Social Sciences
Faculty of Mathematical Sciences University of Twente University for Technical and Social Sciences P.O. Box 17 7500 AE Enschede The Netherlands Phone: +31-53-4893400 Fax: +31-53-4893114 Email: memo@math.utwente.nl
More informationAndrea Scozzari Università Niccolò Cusano Telematica, Roma
Andrea Scozzari Università Niccolò Cusano Telematica, Roma Joint research with: J. Puerto Universidad de Sevilla F. Ricca Sapienza, Università di Roma The Exploratory Workshop on Locational Analysis: Trends
More informationHamiltonicity in Connected Regular Graphs
Hamiltonicity in Connected Regular Graphs Daniel W. Cranston Suil O April 29, 2012 Abstract In 1980, Jackson proved that every 2-connected k-regular graph with at most 3k vertices is Hamiltonian. This
More informationHOW IS A CHORDAL GRAPH LIKE A SUPERSOLVABLE BINARY MATROID?
HOW IS A CHORDAL GRAPH LIKE A SUPERSOLVABLE BINARY MATROID? RAUL CORDOVIL, DAVID FORGE AND SULAMITA KLEIN To the memory of Claude Berge Abstract. Let G be a finite simple graph. From the pioneering work
More informationOn decomposing graphs of large minimum degree into locally irregular subgraphs
On decomposing graphs of large minimum degree into locally irregular subgraphs Jakub Przyby lo AGH University of Science and Technology al. A. Mickiewicza 0 0-059 Krakow, Poland jakubprz@agh.edu.pl Submitted:
More informationIBM Almaden Research Center, 650 Harry Road, School of Mathematical Sciences, Tel Aviv University, TelAviv, Israel
On the Complexity of Some Geometric Problems in Unbounded Dimension NIMROD MEGIDDO IBM Almaden Research Center, 650 Harry Road, San Jose, California 95120-6099, and School of Mathematical Sciences, Tel
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics ( ) Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam On the forbidden induced subgraph sandwich problem
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationFixed Parameter Algorithms for Interval Vertex Deletion and Interval Completion Problems
Fixed Parameter Algorithms for Interval Vertex Deletion and Interval Completion Problems Arash Rafiey Department of Informatics, University of Bergen, Norway arash.rafiey@ii.uib.no Abstract We consider
More information