The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs

https://doi.org/10.1016/j.endm.2010.05.071Get rights and content

Abstract

The notion of k-limited packing in a graph is a generalization of 2-packing. For a given non negative integer k, a subset B of vertices is a k-limited packing if there are at most k elements of B in the closed neighborhood of every vertex. On the other side, a k-tuple domination set in a graph is a subset of vertices D such that every vertex has at least k elements of D in its closed neighborhood. In this work we first reveal a strong relationship between these notions, and obtain from a result due to Liao and Chang (2002), the polynomiality of the k-limited packing problem for strongly chordal graphs.

We also prove that, in coincidence with the case of domination, the k-limited packing problem is NP-complete for split graphs. Finally, we prove that both problems are polynomial for the non-perfect class of P4-tidy graphs, including the perfect classes of P4-sparse graphs and cographs.

References (10)

There are more references available in the full text version of this article.

Cited by (12)

  • Labelled packing functions in graphs

    2020, Information Processing Letters
  • NP-completeness of the {k}-packing function problem in graphs

    2015, Electronic Notes in Discrete Mathematics
  • Generalized limited packings of some graphs with a limited number of P<inf>4</inf>-partners

    2015, Theoretical Computer Science
    Citation Excerpt :

    The all ones vector is denoted by 1. Let us introduce GLP formally [2]. In this section, we show how to handle generalized limited packings and some graph operations such as union and join.

  • Limited Packing and Multiple Domination problems: Polynomial time reductions

    2014, Discrete Applied Mathematics
    Citation Excerpt :

    Second, some places where to locate the facilities may be “not allowed” (for the packing case) and “required” (for the covering case). In this sense, generalized versions for MD and LP were first introduced in [8,3], respectively. In Section 4, we prove that, within graph classes that are closed under certain operations, LP and MD are, respectively, “as hard” as their generalizations.

View all citing articles on Scopus

Partially supported by grant of ANPCyT-PICT 38036 (2005).

View full text