# Graph Isomorphism Completeness for Perfect Graphs and Subclasses of Perfect Graphs

Save this PDF as:

Size: px
Start display at page:

Download "Graph Isomorphism Completeness for Perfect Graphs and Subclasses of Perfect Graphs"

## Transcription

1 Graph Isomorphism Completeness for Perfect Graphs and Subclasses of Perfect Graphs C. Boucher D. Loker May 2006 Abstract A problem is said to be GI-complete if it is provably as hard as graph isomorphism; that is, there is a polynomial-time Turing reduction from the graph isomorphism problem. It is known that the GI problem is GI-complete for some special graph classes including regular graphs, bipartite graphs, chordal graphs and split graphs. In this paper, we prove that deciding isomorphism of double split graphs, the class of graphs exhibiting a 2-join, and the class of graphs exhibiting a balanced skew partition are GI-complete. Further, we show that the GI problem for the larger class including these graph classes that is, the class of perfect graphs is also GI-complete. 1 Introduction The Graph Isomorphism (GI) problem consists of deciding whether two given graphs are isomorphic and thus, consists of determining whether there exists a bijective mapping from the vertices of one graph to the vertices of the second graph such that the edge adjacencies are respected. The GI problem is a well-known open problem that was first listed as an important open problem in Karp s paper over three decades ago [Kar72]. GI is of great interest since it is one of the few problems contained in NP that is neither known to be computable in polynomial time nor to be NP-complete. Presently, there is no known polynomial-time algorithm for graph isomorphism and further, there is strong evidence that the problem is not NP-complete. Mathon [Mat79] demonstrates that the problem of counting the number of isomorphisms between two labeled graphs is Turing reducible to GI; this gives indication that GI is unlikely to be NP-complete since for almost all NP-complete problems their counting versions are of much higher complexity than themselves. The inability to find a polynomial-time algorithm for the GI problem demonstrates evidence that it is unlikely that the problem is in P.

2 A problem is said to be GI-complete if it is provably as hard as graph isomorphism; that is, there is a Turing reduction to the graph isomorphism problem. Graph isomorphism remains GI-complete even when restricted to a number of hard special classes, including regular graphs, bipartite graphs, chordal graphs, comparability graphs, split graphs, and -trees with unbounded. Recently, Uehara et al. [UTN05] showed that deciding the isomorphism of strongly chordal graphs is GI-Complete. Specific subclasses of bipartite graphs have been shown to be GI-complete namely, isomorphism is GI-complete for chordal bipartite graphs [NUT93], which shows a distinction between the class of convex graphs and chordal bipartite graphs. On the other hand, there exists specific cases of the GI problem that have efficient, polynomialtime algorithms; such cases require restrictions upon the class of graphs considered. Examples of such restricted classes include, but are not limited to: planar graphs, interval graphs, convex graph [Che99] and permutation graphs. Given the current divide between graph classes that exhibit a polynomial-time algorithm for GI and those where GI is provable to be GI-complete, significant attention has been given towards investigating classes for which the relative complexity of the GI problem is not known. Many classes have been proposed and widely investigated; we refer the reader to Brandstädt, Le, and Spinrad [BLS99] for a comprehensive survey of this topic. We prove that deciding isomorphism for double split graphs, the class of graphs admitting a balanced skew partition, and the class of graphs admitting a 2-join is GI-complete. We consider the implications of these results to the related graph classes namely, QP and SQP. 2 Preliminaries In order to be self-contained we describe all definitions and results from graph theory and computational complexity required for the comprehension of our results. We restrict attention to finite simple graphs and use standard graph-theoretic notation, where is the vertex set and. We denote the complement of a given graph as. The complement of a graph can trivially be computed in polynomial time. A graph is bipartite if can be divided into two sets and such that every edge joins exactly one vertex in to another vertex in. A clique of a graph is a subgraph of such that every pair of vertices vertices in are adjacent. We denote as the size of the largest clique in the graph. A stable set is a set of vertices such that, where is the induced subgraph of and is the null graph with vertices. A path has distinct nodes and edges for. If and, then the graph! is called a cycle. The number of edges in a path or cycle is its length. We denote a path of length by. An edge which joins two nodes of a path or cycle but is not itself an edge of the path or cycle, is called a chord. We refer to a hole as an induced subgraph that is a chordless cycle of length at least four and an antihole as the complement of a 2

3 hole. An even pair is any pair of non-adjacent vertices such that every chordless path between them has even length. A colouring of a graph is a mapping such that for all. If then is a k-colouring. The smallest such that admits a -colouring is the chromatic number. The gap between the lower bound and the chromatic number can be arbitrary large [Car01]. Berge [Ber61] called a graph perfect if and only if the coincides with for all proper induced subgraphs of. All other graphs are imperfect. We say that is a double split graph if can be partitioned into four sets!,!,!,! for some, such that: is adjacent to for and is nonadjacent to for ; there are no edges between! and! for and all four edges between! and! for ; there are exactly two edges between! and! for and, and these two edges have no common end. Further, we aim to show GI for the class of graphs admitting a 2-join is GI-complete. We let, be a partition of,, be non-empty disjoint subsets of and, be non-empty disjoint subsets of. If for, every vertex of is adjacent to every vertex of and there are no other edges between and, then we say that admits a 2-join. This concept was introduced by Cornuéjols and Cunningham [CC85] in Both double split graphs and graphs exhibiting a 2-join are perfect graphs [C+06]. We will show that GI for these graph classes is GI-complete and that GI for perfect graphs is also GI-complete. 2.1 Graph Isomorphism We define two graphs and to be isomorphic if there is a bijection such that if and only if. We write and call an isomorphism. Hence, the GI problem is to determine if for given input graphs and. If and are isomorphic, it follows from the definition that there exists a bijection which preserves edge adjacencies. Let! and!. It follows that if and only if, and further because is an isomorphism for and we have that if and only if. Finally, if and only if proves that if and only if. If and are not isomorphic, a similar result can be shown. Thus, we have the following fact. Observation 1 Given two graphs and and their respective complements and, if and only if. 3

4 An early result by Booth and Lueker [BL79] will be central to a simple proof we give for showing that the class of perfect graphs are GI-complete. They prove that graph isomorphism is polynomially-reducible to chordal graph isomorphism [BL79] by defining a mapping from an arbitrary graph to a chordal graph. Trivially, this mapping can be carried out in polynomial time and perserves the isomorphism property, demonstrating that GI for the class of chordal graphs is GI-complete. Theorem 1 ([BL79]) The GI problem for arbitrary graphs is polynomially reducible to chordal graphs. Using this result we prove two important results one that proves that the GI-completeness of a subclass of a graph class implies the GI-completeness of the encompasing class and another that demonstrates that the GI problem restricted to any arbitrary graph class is in GI. The following lemma has important ramfications for many restricted graph classes since the inclusion of chordal graphs is not severe; thus, implying that GI for many restricted graph classes is GI-complete. Lemma 1 Given the graph classes and such that, if GI for is GI-complete then GI for is GI-complete. Proof. Given that is GI-complete then is GI-hard, implying that there there exists a polynomialtime Turing reduction from the GI problem of arbitrary graphs to the GI problem of graphs in the class. This same reduction can then be applied to graphs in, thus, showing that the GI problem for class is in GI. Next, we demonstrate that isomorphism for graphs in is at least as hard as isomorphism for graphs in. Suppose otherwise, that there exits a polynomial-time algorithm for solving the GI problem when attention is restricted to graphs in, then it follows that this algorithm can be applied to any graph in (since if then ). Hence, the same algorithm that is a polynomial-time algorithm for the class exists for the class, contradicting the fact that the class is GI-hard. The following lemma demonstrates that in order to demonstrate that any graph class is GIcomplete we need only give a polynomial-time reduction from any known GI-comlpete graph class to the considered class that preserves graph isomorphism. Lemma 2 The GI problem for any restricted graph class is in the class GI. Proof. We define a mapping from an arbitrary graph to a chordal graph, corresponding to the mapping of Booth and Leuker [BL79]. It is apparent that this mapping can be carried out in polynomial time and preserves the isomorphism property. Since any graph in any given graph class can be considered to be an arbitrary graph, the mapping can be applied. Hence, this demonstrates that there exists a polynomial-time reduction from any given graph class to the class of chordal graphs that preserves the isomorphism property and therefore is in the class GI. 4

5 3 Main Results As previously mentioned, the set of known GI-complete graph classes includes bipartite graphs and line graphs [BC79]. Further, when attention is restricted to the class of comparability graphs and chordal graphs isomorphism remains GI-complete [UTN05]. The polynomial-time reduction of isomorphism for arbitrary graphs to isomorphism for chordal graphs then demonstrates that isomorphism for the class of perfect graphs is GI-complete since that reduction can be applied to perfect non-chordal graphs. Further, we restrict interest to two specific subclasses of perfect graphs and show that GI for these classes is GI-complete. 3.1 Perfect Graphs and GI-Completeness We have the following lemma that demonstrates that the class of perfect graphs is GI-complete. Using Lemma 1 we can explicitly show that the class of perfect graphs is GI-complete. Lemma 3 The GI problem for the class of perfect graphs is GI-complete. Proof. Clearly, chordal graphs are a subclass of perfect graphs. It follows then from the fact that GI for chordal graphs is GI-complete [BL79] and Lemma 1, that perfect graphs are GI-complete. 3.2 Reduction for Double Split Graphs A split graph is a graph whose vertex set can be partitioned into a non-empty stable set and a non-empty clique. It is known that the GI problem is GI-complete if attention is restricted to split graphs [UTN05]. We form a double split graph by taking a split graph where is a clique, is a stable set, and contains edges between and, replacing every node by two non-adjacent nodes and every node by two adjacent nodes, and for every edge! we have!,!, and for every edge! we have!,!. We let be the set of all, the set of all, the set of all and the set of all. Finally, for every and with, we have all four edges between! and!. See figure 1 for an example of this reduction. Lemma 4 is a double split graph. Proof. First we note that and, and let. Our sets can be rewritten as!!!!. Note that implies that. Thus, from our construction we see that is a double split graph. Lemma 5 Given split graphs and, if and only if. 5

6 Figure 1: Reduction from split graph to double split graph Proof. It is clear that if then. It remains to show the other direction. By construction, if! then three things follow:!, no other edges exist between! and!, and!. Further, if! then!, no other edges exist between! and!, and!. It follows that every split graph reduces to an unique double split graph, and that the split graph can be uniquely recovered from our constructed double split graph. Therefore, if then. The first of the two main theorems in the paper is the following. Theorem 2 The GI problem for double split graphs is GI-complete. Proof. Graph isomorphism for the class of double split graphs is trivially in the class GI. It is apparent that the reduction from split graphs to double split graphs can be done in polynomial time and therefore, if follows from lemmas 4 and 5 that this claim for double split graphs holds. 3.3 Reduction for 2-join Graphs The reduction from any given non-trivial bipartite graph to a 2-join graph works as follows: given the bipartite graph with non-empty vertex partitions, the vertex set of the reduced graph contains and for every and for every. The edge set of the reduced graph contains an edge! for all and and similarly for each and. Finally,! if!. See figure 2 for an example of this reduction. Lemma 6 admits a 2-join. Proof. Define. For every vertex of is adjacent to every vertex of and there are no other edges between and. Thus, admits a 2-join. Lemma 7 Given non-trivial bipartite graphs and, if and only if. Proof. If then the result follows. Let and assume that with isomorphism. If then. Assume the edge set is 6

7 non-empty and note that and. For any we know that. Suppose otherwise, and assume that. was only adjacent to vertices in and so must map each vertex in to either or the set of vertices adjacent to. Note that because at least one vertex of must be mapped to. If this contradicts the ismorphic mapping because the degree of is not the same as the degree of. If then the vertices from mapped to have too small of a degree. Hence,. This means that every vertex in was mapped to a single vertex in. From this, we see that every vertex in was mapped to a single vertex in. This contradicts our definition of a 2-join because vertices in cannot be adjacent to vertices from or, which is what must do in order to map the remaining vertices from to. A similar argument holds if, and both arguments can be reapplied for any. Thus, must map vertices from to preserving edge adjacencies. Therefore,. Theorem 3 The GI problem for the class of graphs admitting a 2-join is GI-complete. Proof. By Lemma 2 GI for the class of graphs admitting a 2-join is in the class GI. It is apparent that the reduction from bipartite graphs to graphs admitting a 2-join can be done in polynomial time and therefore, if follows from Lemma 6 and Lemma 7 that this claim for graphs admitting a 2-join holds. Figure 2: Reduction from bipartite graph to 2-join graph Lemma 8 The GI problem for the class of graphs whose complement exhibits a 2-join is GIcomplete. 7

8 Proof. Again, by Lemma 2 that the GI problem for the class of graphs exhibiting a 2-join is in the class GI. If we let and be two graphs admitting a 2-join then their respective complements and can be computed in polynomial time. This construction together with Observation 1 then shows that the GI problem for the class of graphs whose complement exhibits a 2-join is GI-complete. 3.4 Implications to Other Graph Classes On the basis of the concept of even pairs in a graph, we now define two classes of perfect graphs: quasi-parity (QP) and strict quasi-parity SQP. The class of SQP graphs is defined as the class of graphs where every induced subgraph is either a clique or contains an even pair, and is first defined by Meyniel in 1987 [Mey87]. Meyniel proves that no minimally imperfect graph has an even pair [Mey87] and as a consequence, shows that every SQP graph is perfect. A graph is called QP if, for every induced subgraph of on at least two vertices, either or its complement has an even pair. Meyniel further proves that QP graphs are perfect [Mey87]. The class of chordal bipartite graphs is contained in the class of strongly chordal graphs[utn05] and further, strongly chordal graphs are a subclass of SQP graphs [LMR01]. Hence, we have the following inclusion: chordal bipartite strongly chordal SQP QP. Uehara et al. [UTN05] show that the GI problem for both chordal bipartite graphs and strongly chordal graphs are GI-complete. As an implication of these results, Lemma 2 and inclusion of graph classes described above, we have that GI for SQP graphs is GI-complete. Further, we conclude that GI for QP graphs is GI-complete; this result follows from the above inclusion and an additional application of Lemma 2. In addition, Lemma 2 and inclusion properties of specific graph classes can be used to demonstrate that other graph classes are GI-complete. For example, a graph is perfectly contractile if for all induced subgraphs there is a sequence such that is a clique and is obtained from by contracting an even pair. Therefore, in a similar manner to above it can be demonstrated that perfectly contractile graphs are GI-complete since strongly chordal graphs are a subclass of perfectly contractile graphs [Ber90]. Babel et al. [BPT96] demonstrate that GI for directed path graphs is GI-complete. Uehara et al. [UTN05] explicitly give a reduction from chordal bipartite graphs to a strongly chordal graphs in order to demonstrate that strongly chordal graphs are GI-complete. However, given that directed path graphs are a subclass of strongly chordal graphs and that GI for directed path graphs is GI-complete, Lemma 1 trivially implies that GI for strongly chordal graphs is GI-complete. 8

9 4 Concluding Remarks There are many graph classes for which we do not know whether the GI problem is GI-complete or polynomial-time solvable. In order to obtain further insight into the complexity of the GI problem, the complexity of GI for other restricted graph classes would be advantegous. For example, clique separable graphs, which is a subclass of perfectly contractile graphs as shown by Bertschi [Ber90], is a subclass of perfect graphs where the complexity of the GI problem is unknown. Further, there does not exist a known graph class that is a subclass of clique separable graphs and for which GI is GI-complete, implying that Lemma 1 does not lead to any results concerning this graph class. However, showing GI for clique separable graphs is GI-complete will imply the results in Section 3.3. The implications of Lemma 1 are vast that is, many graph classes can trivially be shown to be GI-complete. Recently, Chudnovsky et al. [C+06] demonstrate that if is perfect then either belongs to one of the five basic classes defined, or one of, admits a 2-join, or admits a homogeneous pair, or admits a balanced skew partition. Chudnovsky later shows in her doctoral thesis that the class of graphs admitting a homogeneous pair can be eliminated [Chu03]. Given a split graph we know that the vertex set can be partitioned into a stable set and a clique. Therefore, every split graph trivially exhibits a balanced skew partition; is obviously not connected, is not connected, there does not exist any induced path of length greater than or equal to two with ends in (since is a clique), and there does not exist any induced path of length greater than or equal to two with ends in in ( is a stable set and is a clique). Hence, the class of splits graphs is contained in the class of graphs exhibiting a balanced skew partition and it follows from Lemma 1 that the class of graphs exhibiting a balanced skew partition is GI-complete. It is worth remarking that in proving the GI-completness of GI for double split graphs, the class of graphs exhibiting a 2-join, and the class of graphs exhibiting a balanced skew partition, we demonstrate that each of the graph classes Chudnovsky et al. considered to prove the Strong Perfect Graph Theorem are GI-complete. 5 References [Ber90] M. Bertschi, Perfectly contractile graphs, J. Combinatorical Theory, 50(2): , [BC79] K.S. Booth and C.J. Colburn, Problems polynomially equivalent to graph isomorphism, Technical Report CS-77-04, Computer Science Department, University of Waterloo, [BL79] K.S. Booth and G.S. Leuker, A linear time algorithm for deciding interval graph isomorphism, Journal of the ACM, 26(2): ,

10 [BLS99] A. Brandstädt, V.B. Le, and J. P. Spinrad. Graph Classes: A Survey, SIAM, [BPT96] L. Babel, I.N. Ponomarenko and G. Tinhofer, The isomorphism problem for directed path graphs and for rooted directed path graphs, Journal of Algorithms, 21: , [Car01] M. Caramia and P. Dell Olmo, A lower bound on the chromatic number of mycielski graphs, Discrete Mathematics, 235:79-86,2001. [CCK+02] M. Conforti, G. Cornuéjols, A. Kapoor and K. Vušković, Even-hole-free graphs, Part II: Recognition algorithm, Journal of Graph Theory, 40: , [Che99] L. Chen. Graph isomorphism and identification matrices: sequential algorithms, Journal of Computer and Systems Sciences, 59: , [Chu03] M. Chudnovsky, Berge trigraphs and their applications, PhD thesis, Princeton University, Princeton NJ, [C+06] M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas, The Strong Perfect Graph Theorem, Annals of Mathematics, to appear. [Kar72] R.M. Karp, Complexity of computer computations, chapter in Reducibility Among Combinatorial Problems, Plenum Press, New York NY, pages , [LMR01] C. S. Linhares, F. Maffray and B. Reed, Recognizing planar strict quasi-parity graphs, Graphs and Combinatorics, 17: , [Mat79] R. Mathon, A note on the graph isomorphism counting problem, Information Processing Letters, 8: , [Mey87] H. Meyniel, A new property of critical imperfect graphs and some consequences, European Journal of Combinatorics, 8: , [NUT93] T. Nagoya, R. Uehara and S. Toda, Completeness of graph isomorphism problem for bipartite graph classes, Technical Report of IEICE, COMP , [RC77] R.C. Read and D.G. Corneil, The graph isomorphism disease, Journal of Graph Theory, 1: ,

11 [UTN05] R. Uehara, S. Toda and T. Nagoya, Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs, Discrete Applied Mathematics, 145(3): pp ,

### Clique coloring B 1 -EPG graphs

Clique coloring B 1 -EPG graphs Flavia Bonomo a,c, María Pía Mazzoleni b,c, and Maya Stein d a Departamento de Computación, FCEN-UBA, Buenos Aires, Argentina. b Departamento de Matemática, FCE-UNLP, La

### Cycle transversals in bounded degree graphs

Electronic Notes in Discrete Mathematics 35 (2009) 189 195 www.elsevier.com/locate/endm Cycle transversals in bounded degree graphs M. Groshaus a,2,3 P. Hell b,3 S. Klein c,1,3 L. T. Nogueira d,1,3 F.

### On the k-path cover problem for cacti

On the k-path cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we

### Definition 11.1. Given a graph G on n vertices, we define the following quantities:

Lecture 11 The Lovász ϑ Function 11.1 Perfect graphs We begin with some background on perfect graphs. graphs. First, we define some quantities on Definition 11.1. Given a graph G on n vertices, we define

### COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

### Graph Powers: Hardness Results, Good Characterizations and Efficient Algorithms. Dissertation

Graph Powers: Hardness Results, Good Characterizations and Efficient Algorithms Dissertation zur Erlangung des akademischen Grades Doktor-Ingenieur (Dr.-Ing.) der Fakultät für Informatik und Elektrotechnik

### Every tree contains a large induced subgraph with all degrees odd

Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University

### 2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

### arxiv:1203.1525v1 [math.co] 7 Mar 2012

Constructing subset partition graphs with strong adjacency and end-point count properties Nicolai Hähnle haehnle@math.tu-berlin.de arxiv:1203.1525v1 [math.co] 7 Mar 2012 March 8, 2012 Abstract Kim defined

### On the Relationship between Classes P and NP

Journal of Computer Science 8 (7): 1036-1040, 2012 ISSN 1549-3636 2012 Science Publications On the Relationship between Classes P and NP Anatoly D. Plotnikov Department of Computer Systems and Networks,

### 3. Linear Programming and Polyhedral Combinatorics

Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the

### Tree-representation of set families and applications to combinatorial decompositions

Tree-representation of set families and applications to combinatorial decompositions Binh-Minh Bui-Xuan a, Michel Habib b Michaël Rao c a Department of Informatics, University of Bergen, Norway. buixuan@ii.uib.no

### Generating models of a matched formula with a polynomial delay

Generating models of a matched formula with a polynomial delay Petr Savicky Institute of Computer Science, Academy of Sciences of Czech Republic, Pod Vodárenskou Věží 2, 182 07 Praha 8, Czech Republic

### The chromatic spectrum of mixed hypergraphs

The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex

### 1 Definitions. Supplementary Material for: Digraphs. Concept graphs

Supplementary Material for: van Rooij, I., Evans, P., Müller, M., Gedge, J. & Wareham, T. (2008). Identifying Sources of Intractability in Cognitive Models: An Illustration using Analogical Structure Mapping.

### arxiv: v2 [math.co] 30 Nov 2015

PLANAR GRAPH IS ON FIRE PRZEMYSŁAW GORDINOWICZ arxiv:1311.1158v [math.co] 30 Nov 015 Abstract. Let G be any connected graph on n vertices, n. Let k be any positive integer. Suppose that a fire breaks out

### Error Compensation in Leaf Power Problems

Error Compensation in Leaf Power Problems Michael Dom Jiong Guo Falk Hüffner Rolf Niedermeier April 6, 2005 Abstract The k-leaf Power recognition problem is a particular case of graph power problems: For

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### Generalized Induced Factor Problems

Egerváry Research Group on Combinatorial Optimization Technical reports TR-2002-07. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.

### Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

### Minimum degree condition forcing complete graph immersion

Minimum degree condition forcing complete graph immersion Matt DeVos Department of Mathematics Simon Fraser University Burnaby, B.C. V5A 1S6 Jacob Fox Department of Mathematics MIT Cambridge, MA 02139

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### Discrete Applied Mathematics. The firefighter problem with more than one firefighter on trees

Discrete Applied Mathematics 161 (2013) 899 908 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam The firefighter problem with

### Exponential time algorithms for graph coloring

Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A k-labeling of vertices of a graph G(V, E) is a function V [k].

### Odd induced subgraphs in graphs of maximum degree three

Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A long-standing

### Total colorings of planar graphs with small maximum degree

Total colorings of planar graphs with small maximum degree Bing Wang 1,, Jian-Liang Wu, Si-Feng Tian 1 Department of Mathematics, Zaozhuang University, Shandong, 77160, China School of Mathematics, Shandong

### P versus NP, and More

1 P versus NP, and More Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 If you have tried to solve a crossword puzzle, you know that it is much harder to solve it than to verify

### Outline 2.1 Graph Isomorphism 2.2 Automorphisms and Symmetry 2.3 Subgraphs, part 1

GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Abstract. Chapter focuses on the question of when two graphs are to be regarded as the same, on symmetries, and on subgraphs.. discusses the concept

### Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

### CSC 373: Algorithm Design and Analysis Lecture 16

CSC 373: Algorithm Design and Analysis Lecture 16 Allan Borodin February 25, 2013 Some materials are from Stephen Cook s IIT talk and Keven Wayne s slides. 1 / 17 Announcements and Outline Announcements

### Determination of the normalization level of database schemas through equivalence classes of attributes

Computer Science Journal of Moldova, vol.17, no.2(50), 2009 Determination of the normalization level of database schemas through equivalence classes of attributes Cotelea Vitalie Abstract In this paper,

### Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs

CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like

### A Turán Type Problem Concerning the Powers of the Degrees of a Graph

A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:

### Discrete Mathematics Problems

Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 E-mail: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................

### princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of

### CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

### Polytope Examples (PolyComp Fukuda) Matching Polytope 1

Polytope Examples (PolyComp Fukuda) Matching Polytope 1 Matching Polytope Let G = (V,E) be a graph. A matching in G is a subset of edges M E such that every vertex meets at most one member of M. A matching

### POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

### SOLUTIONS TO ASSIGNMENT 1 MATH 576

SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts

### Single machine parallel batch scheduling with unbounded capacity

Workshop on Combinatorics and Graph Theory 21th, April, 2006 Nankai University Single machine parallel batch scheduling with unbounded capacity Yuan Jinjiang Department of mathematics, Zhengzhou University

### ON THE COMPLEXITY OF THE GAME OF SET. {kamalika,pbg,dratajcz,hoeteck}@cs.berkeley.edu

ON THE COMPLEXITY OF THE GAME OF SET KAMALIKA CHAUDHURI, BRIGHTEN GODFREY, DAVID RATAJCZAK, AND HOETECK WEE {kamalika,pbg,dratajcz,hoeteck}@cs.berkeley.edu ABSTRACT. Set R is a card game played with a

### Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs

Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs Artur Czumaj Asaf Shapira Christian Sohler Abstract We study graph properties which are testable for bounded degree graphs in time independent

### Making life easier for firefighters

Making life easier for firefighters Fedor V. Fomin, Pinar Heggernes, and Erik Jan van Leeuwen Department of Informatics, University of Bergen, Norway {fedor.fomin, pinar.heggernes, e.j.van.leeuwen}@ii.uib.no

### Split Nonthreshold Laplacian Integral Graphs

Split Nonthreshold Laplacian Integral Graphs Stephen Kirkland University of Regina, Canada kirkland@math.uregina.ca Maria Aguieiras Alvarez de Freitas Federal University of Rio de Janeiro, Brazil maguieiras@im.ufrj.br

### R u t c o r Research R e p o r t. Boolean functions with a simple certificate for CNF complexity. Ondřej Čepeka Petr Kučera b Petr Savický c

R u t c o r Research R e p o r t Boolean functions with a simple certificate for CNF complexity Ondřej Čepeka Petr Kučera b Petr Savický c RRR 2-2010, January 24, 2010 RUTCOR Rutgers Center for Operations

### Connectivity and cuts

Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every

### GRAPH THEORY LECTURE 4: TREES

GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

### Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

### Cycles and clique-minors in expanders

Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor

### 1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

### Introduction to Algorithms Review information for Prelim 1 CS 4820, Spring 2010 Distributed Wednesday, February 24

Introduction to Algorithms Review information for Prelim 1 CS 4820, Spring 2010 Distributed Wednesday, February 24 The final exam will cover seven topics. 1. greedy algorithms 2. divide-and-conquer algorithms

### 3. Equivalence Relations. Discussion

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

### Short Cycles make W-hard problems hard: FPT algorithms for W-hard Problems in Graphs with no short Cycles

Short Cycles make W-hard problems hard: FPT algorithms for W-hard Problems in Graphs with no short Cycles Venkatesh Raman and Saket Saurabh The Institute of Mathematical Sciences, Chennai 600 113. {vraman

### Divisor graphs have arbitrary order and size

Divisor graphs have arbitrary order and size arxiv:math/0606483v1 [math.co] 20 Jun 2006 Le Anh Vinh School of Mathematics University of New South Wales Sydney 2052 Australia Abstract A divisor graph G

### Structural properties of oracle classes

Structural properties of oracle classes Stanislav Živný Computing Laboratory, University of Oxford, Wolfson Building, Parks Road, Oxford, OX1 3QD, UK Abstract Denote by C the class of oracles relative

### All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New

### Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs

MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set

### A NOTE ON OFF-DIAGONAL SMALL ON-LINE RAMSEY NUMBERS FOR PATHS

A NOTE ON OFF-DIAGONAL SMALL ON-LINE RAMSEY NUMBERS FOR PATHS PAWE L PRA LAT Abstract. In this note we consider the on-line Ramsey numbers R(P n, P m ) for paths. Using a high performance computing clusters,

### On the independence number of graphs with maximum degree 3

On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs

### Degree-associated reconstruction parameters of complete multipartite graphs and their complements

Degree-associated reconstruction parameters of complete multipartite graphs and their complements Meijie Ma, Huangping Shi, Hannah Spinoza, Douglas B. West January 23, 2014 Abstract Avertex-deleted subgraphofagraphgisacard.

### The Independence Number in Graphs of Maximum Degree Three

The Independence Number in Graphs of Maximum Degree Three Jochen Harant 1 Michael A. Henning 2 Dieter Rautenbach 1 and Ingo Schiermeyer 3 1 Institut für Mathematik, TU Ilmenau, Postfach 100565, D-98684

### Tenacity and rupture degree of permutation graphs of complete bipartite graphs

Tenacity and rupture degree of permutation graphs of complete bipartite graphs Fengwei Li, Qingfang Ye and Xueliang Li Department of mathematics, Shaoxing University, Shaoxing Zhejiang 312000, P.R. China

### Resource Allocation with Time Intervals

Resource Allocation with Time Intervals Andreas Darmann Ulrich Pferschy Joachim Schauer Abstract We study a resource allocation problem where jobs have the following characteristics: Each job consumes

### Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs

Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs Yong Zhang 1.2, Francis Y.L. Chin 2, and Hing-Fung Ting 2 1 College of Mathematics and Computer Science, Hebei University,

### Institut für Informatik Lehrstuhl Theoretische Informatik I / Komplexitätstheorie. An Iterative Compression Algorithm for Vertex Cover

Friedrich-Schiller-Universität Jena Institut für Informatik Lehrstuhl Theoretische Informatik I / Komplexitätstheorie Studienarbeit An Iterative Compression Algorithm for Vertex Cover von Thomas Peiselt

### An inequality for the group chromatic number of a graph

An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics

### Lecture 3: Linear Programming Relaxations and Rounding

Lecture 3: Linear Programming Relaxations and Rounding 1 Approximation Algorithms and Linear Relaxations For the time being, suppose we have a minimization problem. Many times, the problem at hand can

### A 2-factor in which each cycle has long length in claw-free graphs

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

### 1. Nondeterministically guess a solution (called a certificate) 2. Check whether the solution solves the problem (called verification)

Some N P problems Computer scientists have studied many N P problems, that is, problems that can be solved nondeterministically in polynomial time. Traditionally complexity question are studied as languages:

### Mathematics for Algorithm and System Analysis

Mathematics for Algorithm and System Analysis for students of computer and computational science Edward A. Bender S. Gill Williamson c Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Preface

### arxiv:1606.08087v1 [cs.ds] 26 Jun 2016

Sim-width and induced minors Dong Yeap Kang 1, O-joung Kwon 2, Torstein J. F. Strømme 3, and Jan Arne Telle 3 arxiv:1606.08087v1 [cs.ds] 26 Jun 2016 1 Department of Mathematical Sciences, KAIST, 291 Daehak-ro

### NP-complete? NP-hard? Some Foundations of Complexity. Prof. Sven Hartmann Clausthal University of Technology Department of Informatics

NP-complete? NP-hard? Some Foundations of Complexity Prof. Sven Hartmann Clausthal University of Technology Department of Informatics Tractability of Problems Some problems are undecidable: no computer

### Degree Hypergroupoids Associated with Hypergraphs

Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated

### Minimally Infeasible Set Partitioning Problems with Balanced Constraints

Minimally Infeasible Set Partitioning Problems with alanced Constraints Michele Conforti, Marco Di Summa, Giacomo Zambelli January, 2005 Revised February, 2006 Abstract We study properties of systems of

### On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

### The Open University s repository of research publications and other research outputs

Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:

### Best Monotone Degree Bounds for Various Graph Parameters

Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer

### Labeling outerplanar graphs with maximum degree three

Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics

### High degree graphs contain large-star factors

High degree graphs contain large-star factors Dedicated to László Lovász, for his 60th birthday Noga Alon Nicholas Wormald Abstract We show that any finite simple graph with minimum degree d contains a

### arxiv:1409.4299v1 [cs.cg] 15 Sep 2014

Planar Embeddings with Small and Uniform Faces Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl 3, and Ignaz Rutter 3,4 arxiv:409.499v [cs.cg] 5 Sep 04 Department of Engineering, Roma Tre University, Italy

### 6.2 Permutations continued

6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

### 5.1 Bipartite Matching

CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson

### Week 5: Binary Relations

1 Binary Relations Week 5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all

### M.S. Ibrahim 1*, N. Maculan 2 and M. Minoux 3

Pesquisa Operacional (2014) 34(1): 117-124 2014 Brazilian Operations Research Society Printed version ISSN 0101-7438 / Online version ISSN 1678-5142 www.scielo.br/pope A NOTE ON THE NP-HARDNESS OF THE

### Small Maximal Independent Sets and Faster Exact Graph Coloring

Small Maximal Independent Sets and Faster Exact Graph Coloring David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science The Exact Graph Coloring Problem: Given an undirected

### Lecture 17 : Equivalence and Order Relations DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion

### Introduction to Graph Theory

Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate

### 8. Matchings and Factors

8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,

### On the crossing number of K m,n

On the crossing number of K m,n Nagi H. Nahas nnahas@acm.org Submitted: Mar 15, 001; Accepted: Aug 10, 00; Published: Aug 1, 00 MR Subject Classifications: 05C10, 05C5 Abstract The best lower bound known

### The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

### A Sublinear Bipartiteness Tester for Bounded Degree Graphs

A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite

### Chapter 15. UNROOTED SUPERTREES Limitations, traps, and phylogenetic patchworks. Sebastian Böcker

Chapter 15 UNROOTED SUPERTREES Limitations, traps, and phylogenetic patchworks Sebastian Böcker Abstract: Whereas biologists might think of rooted trees as the natural, or even the only, way to display

### Duality of linear conic problems

Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least

### Finding and counting given length cycles

Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected

### Ph.D. Thesis. Judit Nagy-György. Supervisor: Péter Hajnal Associate Professor

Online algorithms for combinatorial problems Ph.D. Thesis by Judit Nagy-György Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai

### Matthias F.M. Stallmann Department of Computer Science North Carolina State University Raleigh, NC 27695-8206

Matthias F.M. Stallmann Department of Computer Science North Carolina State University Raleigh, NC 27695-8206 August, 1990 UNIFORM PLANAR EMBEDDING IS NP-COMPLETE* MATTHIAS F.M. STALLMANN Key Words. planar

### arxiv:1202.5749v1 [cs.ds] 26 Feb 2012

Fixed-parameter tractability of multicut in directed acyclic graphs Stefan Kratsch Marcin Pilipczuk Micha l Pilipczuk Magnus Wahlström arxiv:1202.5749v1 [cs.ds] 26 Feb 2012 Abstract The Multicut problem,

### 2. (a) Explain the strassen s matrix multiplication. (b) Write deletion algorithm, of Binary search tree. [8+8]

Code No: R05220502 Set No. 1 1. (a) Describe the performance analysis in detail. (b) Show that f 1 (n)+f 2 (n) = 0(max(g 1 (n), g 2 (n)) where f 1 (n) = 0(g 1 (n)) and f 2 (n) = 0(g 2 (n)). [8+8] 2. (a)