Title
Total limited packing in graphs
Authors
Year of publication
2016
Published in
Article type
scientific article
Publication language
english
Keywords
EN
- k-total limited packing
- k-tuple domination
- k-tuple total domination
Abstract
EN 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.
Pages (from - to)
121 - 127
License type
CC BY-NC-ND (attribution - noncommercial - no derivatives)
Full text of article
Access level to full text
public
Ministry points / journal
10
System created by Poznań University of Technology
and Poznan Supercomputing and Networking Center
Log in through eKonto to add to SIS