1,748 research outputs found
Open k-monopolies in graphs: complexity and related concepts
Closed monopolies in graphs have a quite long range of applications in
several problems related to overcoming failures, since they frequently have
some common approaches around the notion of majorities, for instance to
consensus problems, diagnosis problems or voting systems. We introduce here
open -monopolies in graphs which are closely related to different parameters
in graphs. Given a graph and , if is the
number of neighbors has in , is an integer and is a positive
integer, then we establish in this article a connection between the following
three concepts:
- Given a nonempty set a vertex of is said to be
-controlled by if . The set
is called an open -monopoly for if it -controls every vertex of
.
- A function is called a signed total
-dominating function for if for all
.
- A nonempty set is a global (defensive and offensive)
-alliance in if holds for every .
In this article we prove that the problem of computing the minimum
cardinality of an open -monopoly in a graph is NP-complete even restricted
to bipartite or chordal graphs. In addition we present some general bounds for
the minimum cardinality of open -monopolies and we derive some exact values.Comment: 18 pages, Discrete Mathematics & Theoretical Computer Science (2016
Global offensive -alliances in digraphs
In this paper, we initiate the study of global offensive -alliances in
digraphs. Given a digraph , a global offensive -alliance in a
digraph is a subset such that every vertex outside of
has at least one in-neighbor from and also at least more in-neighbors
from than from outside of , by assuming is an integer lying between
two minus the maximum in-degree of and the maximum in-degree of . The
global offensive -alliance number is the minimum
cardinality among all global offensive -alliances in . In this article we
begin the study of the global offensive -alliance number of digraphs. For
instance, we prove that finding the global offensive -alliance number of
digraphs is an NP-hard problem for any value and that it remains NP-complete even when
restricted to bipartite digraphs when we consider the non-negative values of
given in the interval above. Based on these facts, lower bounds on
with characterizations of all digraphs attaining the bounds
are given in this work. We also bound this parameter for bipartite digraphs
from above. For the particular case , an immediate result from the
definition shows that for all digraphs ,
in which stands for the domination number of . We show that
these two digraph parameters are the same for some infinite families of
digraphs like rooted trees and contrafunctional digraphs. Moreover, we show
that the difference between and can be
arbitrary large for directed trees and connected functional digraphs
General -position sets
The general -position number of a graph is the
cardinality of a largest set for which no three distinct vertices from
lie on a common geodesic of length at most . This new graph parameter
generalizes the well studied general position number. We first give some
results concerning the monotonic behavior of with respect to
the suitable values of . We show that the decision problem concerning
finding is NP-complete for any value of . The value of when is a path or a cycle is computed and a structural
characterization of general -position sets is shown. Moreover, we present
some relationships with other topics including strong resolving graphs and
dissociation sets. We finish our exposition by proving that is
infinite whenever is an infinite graph and is a finite integer.Comment: 16 page
- …