In this paper, we investigate the concepts of \(k\)-limited packing and \(k\)-tuple domination in graphs and give several bounds on the size of them. These bounds involve many well-known parameters of graphs. Also, we establish a connection between these concepts that implies some new results in this area. Finally, we improve many bounds in the literature.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.