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

IF 0.2 4区数学 Q4 MATHEMATICS

Mathematical Reports Pub Date : 2018-03-08 DOI:10.59277/mrar.2023.25.75.2.263

J. Kratica, A. Savi'c, Zoran Lj. Maksimovi'c

引用次数: 0

摘要

本文考虑了最近引入的{k}-填充函数问题。引入了k = 1、k≥2与线性规划松弛之间的关系，并给出了最优性的充分条件。对于任意的简单连通图

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

SOME PROPERTIES OF {k}-PACKING FUNCTION PROBLEM IN GRAPHS

The recently introduced {k}-packing function problem is considered in this paper. Relationship between cases when k = 1, k ≥ 2 and linear programming relaxation are introduced with sufficient conditions for optimality. For arbitrary simple connected graph

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Mathematical Reports MATHEMATICS-

CiteScore

0.20

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The journal MATHEMATICAL REPORTS (formerly STUDII SI CERCETARI MATEMATICE) was founded in 1948 by the Mathematics Section of the Romanian Academy. It appeared under its first name until 1998 and received the name of Mathematical Reports in 1999. It is now published in one volume a year, consisting in 4 issues. The current average total number of pages is 500. Our journal MATHEMATICAL REPORTS publishes original mathematical papers, written in English. Excellent survey articles may be also accepted. The editors will put strong emphasis on originality, quality and applicability.