We define a k -total limited packing number in a graph, which generalizes the concept of open packing number in graphs, and give several bounds on it. These bounds involve many well known parameters of graphs. Also, we establish a connection among the concepts of tuple domination, tuple total domination and total limited packing that implies some results.
No takes yet. Share an insight, caveat, or question.
Moghaddam et al. (2016) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: