95,686 research outputs found
The Parameterized Complexity of Domination-type Problems and Application to Linear Codes
We study the parameterized complexity of domination-type problems.
(sigma,rho)-domination is a general and unifying framework introduced by Telle:
a set D of vertices of a graph G is (sigma,rho)-dominating if for any v in D,
|N(v)\cap D| in sigma and for any $v\notin D, |N(v)\cap D| in rho. We mainly
show that for any sigma and rho the problem of (sigma,rho)-domination is W[2]
when parameterized by the size of the dominating set. This general statement is
optimal in the sense that several particular instances of
(sigma,rho)-domination are W[2]-complete (e.g. Dominating Set). We also prove
that (sigma,rho)-domination is W[2] for the dual parameterization, i.e. when
parameterized by the size of the dominated set. We extend this result to a
class of domination-type problems which do not fall into the
(sigma,rho)-domination framework, including Connected Dominating Set. We also
consider problems of coding theory which are related to domination-type
problems with parity constraints. In particular, we prove that the problem of
the minimal distance of a linear code over Fq is W[2] for both standard and
dual parameterizations, and W[1]-hard for the dual parameterization.
To prove W[2]-membership of the domination-type problems we extend the
Turing-way to parameterized complexity by introducing a new kind of non
deterministic Turing machine with the ability to perform `blind' transitions,
i.e. transitions which do not depend on the content of the tapes. We prove that
the corresponding problem Short Blind Multi-Tape Non-Deterministic Turing
Machine is W[2]-complete. We believe that this new machine can be used to prove
W[2]-membership of other problems, not necessarily related to dominationComment: 19 pages, 2 figure
Matching Dynamics with Constraints
We study uncoordinated matching markets with additional local constraints
that capture, e.g., restricted information, visibility, or externalities in
markets. Each agent is a node in a fixed matching network and strives to be
matched to another agent. Each agent has a complete preference list over all
other agents it can be matched with. However, depending on the constraints and
the current state of the game, not all possible partners are available for
matching at all times. For correlated preferences, we propose and study a
general class of hedonic coalition formation games that we call coalition
formation games with constraints. This class includes and extends many recently
studied variants of stable matching, such as locally stable matching, socially
stable matching, or friendship matching. Perhaps surprisingly, we show that all
these variants are encompassed in a class of "consistent" instances that always
allow a polynomial improvement sequence to a stable state. In addition, we show
that for consistent instances there always exists a polynomial sequence to
every reachable state. Our characterization is tight in the sense that we
provide exponential lower bounds when each of the requirements for consistency
is violated. We also analyze matching with uncorrelated preferences, where we
obtain a larger variety of results. While socially stable matching always
allows a polynomial sequence to a stable state, for other classes different
additional assumptions are sufficient to guarantee the same results. For the
problem of reaching a given stable state, we show NP-hardness in almost all
considered classes of matching games.Comment: Conference Version in WINE 201
On a Vizing-type integer domination conjecture
Given a simple graph , a dominating set in is a set of vertices
such that every vertex not in has a neighbor in . Denote the domination
number, which is the size of any minimum dominating set of , by .
For any integer , a function
is called a \emph{-dominating function} if the sum of its function
values over any closed neighborhood is at least . The weight of a
-dominating function is the sum of its values over all the vertices. The
-domination number of , , is defined to be the
minimum weight taken over all -domination functions. Bre\v{s}ar,
Henning, and Klav\v{z}ar (On integer domination in graphs and Vizing-like
problems. \emph{Taiwanese J. Math.} {10(5)} (2006) pp. 1317--1328) asked
whether there exists an integer so that . In this note we use the Roman -domination number,
of Chellali, Haynes, Hedetniemi, and McRae, (Roman
-domination. \emph{Discrete Applied Mathematics} {204} (2016) pp.
22-28.) to prove that if is a claw-free graph and is an arbitrary
graph, then , which also implies the conjecture for all .Comment: 8 page
Distal and non-distal NIP theories
We study one way in which stable phenomena can exist in an NIP theory. We
start by defining a notion of 'pure instability' that we call 'distality' in
which no such phenomenon occurs. O-minimal theories and the p-adics for example
are distal. Next, we try to understand what happens when distality fails. Given
a type p over a sufficiently saturated model, we extract, in some sense, the
stable part of p and define a notion of stable-independence which is implied by
non-forking and has bounded weight. As an application, we show that the
expansion of a model by traces of externally definable sets from some adequate
indiscernible sequence eliminates quantifiers
Edge Roman domination on graphs
An edge Roman dominating function of a graph is a function satisfying the condition that every edge with
is adjacent to some edge with . The edge Roman
domination number of , denoted by , is the minimum weight
of an edge Roman dominating function of .
This paper disproves a conjecture of Akbari, Ehsani, Ghajar, Jalaly Khalilabadi
and Sadeghian Sadeghabad stating that if is a graph of maximum degree
on vertices, then . While the counterexamples having the edge Roman domination numbers
, we prove that is an upper bound for connected graphs. Furthermore, we
provide an upper bound for the edge Roman domination number of -degenerate
graphs, which generalizes results of Akbari, Ehsani, Ghajar, Jalaly Khalilabadi
and Sadeghian Sadeghabad. We also prove a sharp upper bound for subcubic
graphs.
In addition, we prove that the edge Roman domination numbers of planar graphs
on vertices is at most , which confirms a conjecture of
Akbari and Qajar. We also show an upper bound for graphs of girth at least five
that is 2-cell embeddable in surfaces of small genus. Finally, we prove an
upper bound for graphs that do not contain as a subdivision, which
generalizes a result of Akbari and Qajar on outerplanar graphs
- …