arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.03147math.CO
收藏

图中$\{k\}$ -填充函数问题的一些性质

Some properties of $\{k\}$-packing function problem in graphs

Jozef J. Kratica, Aleksandar Lj. Savić, Zoran Lj. Maksimović

摘要:

本文考虑最近引入的$\{k\}$ -填充函数问题。引入了$k=1$、$k\ge 2$与线性规划松弛之间的特殊关系,给出了最优性的充分条件.对于任意简单连通图$G$,给出了求$k$值的构造过程,从而可以在多项式时间内求出$L_{\{k\}}(G)$.此外,还建立了$\{1\}$ -packing函数与独立集个数之间的关系.给出了一些特殊图类的最优值和一般的上下界。

英文摘要:

The recently introduced $\{k\}$-packing function problem is considered in this paper. Special relation between a case when $k=1$, $k\ge 2$ and linear programming relaxation is introduced with sufficient conditions for optimality. For arbitrary simple connected graph $G$ there is construction procedure for finding values of $k$ for which $L_{\{k\}}(G)$ can be determined in the polynomial time. Additionally, relationship between $\{1\}$-packing function and independent set number is established. Optimal values for some special classes of graphs and general upper and lower bounds are introduced.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑