Research Info

Home /Limited packing vs tuple ...
Title Limited packing vs tuple domination in graphs
Type JournalPaper
Keywords Double domination, k-limited packing, k-tuple domination.
Abstract 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. This 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 literatures.
Researchers Seyed Mehdi Hosseini Moghaddam (Third Researcher), Babak Samadi (Second Researcher), Doost Ali Mojdeh (First Researcher)