1,122 research outputs found
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
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
A 3-path vertex cover in a graph is a vertex subset such that every path
of three vertices contains at least one vertex from . The parameterized
3-path vertex cover problem asks whether a graph has a 3-path vertex cover of
size at most . In this paper, we give a kernel of vertices and an
-time and polynomial-space algorithm for this problem, both new
results improve previous known bounds.Comment: in TAMC 2016, LNCS 9796, 201
On Minimum Maximal Distance-k Matchings
We study the computational complexity of several problems connected with
finding a maximal distance- matching of minimum cardinality or minimum
weight in a given graph. We introduce the class of -equimatchable graphs
which is an edge analogue of -equipackable graphs. We prove that the
recognition of -equimatchable graphs is co-NP-complete for any fixed . We provide a simple characterization for the class of strongly chordal
graphs with equal -packing and -domination numbers. We also prove that
for any fixed integer the problem of finding a minimum weight
maximal distance- matching and the problem of finding a minimum weight
-independent dominating set cannot be approximated in polynomial
time in chordal graphs within a factor of unless
, where is a fixed constant (thereby
improving the NP-hardness result of Chang for the independent domination case).
Finally, we show the NP-hardness of the minimum maximal induced matching and
independent dominating set problems in large-girth planar graphs.Comment: 15 pages, 4 figure
- …