Some properties of $\{k\}$-packing function problem in graphs
Combinatorics
2018-03-09 v1
Abstract
The recently introduced -packing function problem is considered in this paper. Special relation between a case when , and linear programming relaxation is introduced with sufficient conditions for optimality. For arbitrary simple connected graph there is construction procedure for finding values of for which can be determined in the polynomial time. Additionally, relationship between -packing function and independent set number is established. Optimal values for some special classes of graphs and general upper and lower bounds are introduced.
Cite
@article{arxiv.1803.03147,
title = {Some properties of $\{k\}$-packing function problem in graphs},
author = {Jozef J. Kratica and Aleksandar Lj. Savić and Zoran Lj. Maksimović},
journal= {arXiv preprint arXiv:1803.03147},
year = {2018}
}