15 research outputs found
Total Domishold Graphs: a Generalization of Threshold Graphs, with Connections to Threshold Hypergraphs
A total dominating set in a graph is a set of vertices such that every vertex
of the graph has a neighbor in the set. We introduce and study graphs that
admit non-negative real weights associated to their vertices such that a set of
vertices is a total dominating set if and only if the sum of the corresponding
weights exceeds a certain threshold. We show that these graphs, which we call
total domishold graphs, form a non-hereditary class of graphs properly
containing the classes of threshold graphs and the complements of domishold
graphs, and are closely related to threshold Boolean functions and threshold
hypergraphs. We present a polynomial time recognition algorithm of total
domishold graphs, and characterize graphs in which the above property holds in
a hereditary sense. Our characterization is obtained by studying a new family
of hypergraphs, defined similarly as the Sperner hypergraphs, which may be of
independent interest.Comment: 19 pages, 1 figur
On the algorithmic complexity of twelve covering and independence parameters of graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to covering and independence, each of which has been studied previously in some form. Here we survey briefly results concerning total coverings and total matchings of graphs, and consider the aforementioned 12 covering and independence parameters with regard to algorithmic complexity. We survey briefly known results for several graph classes, and obtain new NP-completeness results for the minimum total cover and maximum minimal total cover problems in planar graphs, the minimum maximal total matching problem in bipartite and chordal graphs, and the minimum independent dominating set problem in planar cubic graphs
The Computational Complexity of Evil Hangman
The game of Hangman is a classical asymmetric two player game in which one player, the setter, chooses a secret word from a language, that the other player, the guesser, tries to discover through single letter matching queries, answered by all occurrences of this letter if any. In the Evil Hangman variant, the setter can change the secret word during the game, as long as the new choice is consistent with the information already given to the guesser. We show that a greedy strategy for Evil Hangman can perform arbitrarily far from optimal, and most importantly, that playing optimally as an Evil Hangman setter is computationally difficult. The latter result holds even assuming perfect knowledge of the language, for several classes of languages, ranging from Finite to Turing Computable. The proofs are based on reductions to Dominating Set on 3-regular graphs and to the Membership problem, combinatorial problems already known to be computationally hard
Efficient Algorithms for Graphs with Few P-4’s
We show that a large variety of NP-complete problems can be solved efficiently for graphs with \u27few\u27 P4\u27s. We consider domination problems (domination, total domination, independent domination. connected domination and dominating clique), the Steiner tree problem, the vertex ranking problem, the pathwidth problem, the path cover number problem, the hamiltonian circuit problem, the list coloring problem and the precoloring extension problem. We show that all these problems can be solved in linear time for the class of (q,q - 4)-graphs, for every fixed q. These are graphs for which no set of at most q. vertices induces more than q - 4 different P4\u27s. © 2001 Elsevier Science B.V. All rights reserved
On dominating set polyhedra of circular interval graphs
Clique-node and closed neighborhood matrices of circular interval graphs are circular matrices. The stable set polytope and the dominating set polytope on these graphs are therefore closely related to the set packing polytope and the set covering polyhedron on circular matrices. Eisenbrand et al. [18] take advantage of this relationship to propose a complete linear description of the stable set polytope on circular interval graphs. In this paper we follow similar ideas to obtain a complete description of the dominating set polytope on the same class of graphs. As in the packing case, our results are established for a larger class of covering polyhedra of the form Q ∗ (A, b) := conv {x ∈ Z n + : Ax ≥ b}, with A a circular matrix and b an integer vector. These results also provide linear descriptions of polyhedra associated with several variants of the dominating set problem on circular interval graphs.Fil: Bianchi, Silvia MarÃa. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, IngenierÃa y Agrimensura; ArgentinaFil: Nasini, Graciela Leonor. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, IngenierÃa y Agrimensura; Argentina. Consejo Nacional de Investigaciones CientÃficas y Técnicas. Centro CientÃfico Tecnológico Conicet - Rosario; ArgentinaFil: Tolomei, Paola Beatriz. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, IngenierÃa y Agrimensura; Argentina. Consejo Nacional de Investigaciones CientÃficas y Técnicas. Centro CientÃfico Tecnológico Conicet - Rosario; ArgentinaFil: Torres, Luis Miguel. Escuela Politécnica Nacional; Ecuado