Abstract

Abstract 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call