Total limited packing in graphs
2016
artykuł naukowy
angielski
- k-total limited packing
- k-tuple domination
- k-tuple total domination
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.
121 - 127
CC BY-NC-ND (uznanie autorstwa - użycie niekomercyjne - bez utworów zależnych)
publiczny
10