Total limited packing in graphs, By Doost Ali Mojdeh

Research

Title	Total limited packing in graphs
Type	Article
Keywords	k-total limited packing, k-tuple domination, k-tupletotal domination
Journal	Fasciculi Mathematici
DOI	—
Researchers	Seyed Mehdi Hosseini Moghaddam (First researcher) , Doost Ali Mojdeh (Second researcher) , Babak Samadi (Third researcher)

Abstract

We dene 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.