Limited packings: Related vertex partitions and duality issues

Azam Sadat Ahmadi, Nasrin Soltankhah and Babak Samadi

Applied Mathematics and Computation, 2024, vol. 472, issue C

Abstract: A k-limited packing partition (kLP partition) of a graph G is a partition of V(G) into k-limited packing sets. We consider the kLP partitions with minimum cardinality (with emphasis on k=2). The minimum cardinality is called kLP partition number of G and denoted by χ×k(G). This problem is the dual problem of k-tuple domatic partitioning as well as a generalization of the well-studied 2-distance coloring problem in graphs.

Keywords: Limited packing; 2-Limited packing partition number; NP-hard; Tuple domination; Lexicographic product; Nordhaus-Gaddum inequality (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324000857
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:472:y:2024:i:c:s0096300324000857

DOI: 10.1016/j.amc.2024.128613

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().