The packing number of cubic graphs

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED

Discrete Optimization Pub Date : 2024-08-01 DOI:10.1016/j.disopt.2024.100850

引用次数: 0

Abstract

A packing in a graph is a set of vertices that are mutually distance at least 3 apart. By using optimization and linear programming to help analyze the greedy algorithm, we improve on a result of Favaron and show that every connected cubic graph of order $n$ has a packing of size at least $\frac{17}{132} n - O (1)$ .

查看原文本刊更多论文

立体图形的堆积数

图中的堆积是指相互距离至少为 3 的顶点集合。通过使用优化和线性规划来帮助分析贪婪算法，我们改进了法瓦隆的一个结果，并证明了每一个有序连通的立方图都有一个大小至少为。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Optimization 管理科学-应用数学

CiteScore

2.10

自引率

9.10%

发文量

审稿时长

>12 weeks

期刊介绍： Discrete Optimization publishes research papers on the mathematical, computational and applied aspects of all areas of integer programming and combinatorial optimization. In addition to reports on mathematical results pertinent to discrete optimization, the journal welcomes submissions on algorithmic developments, computational experiments, and novel applications (in particular, large-scale and real-time applications). The journal also publishes clearly labelled surveys, reviews, short notes, and open problems. Manuscripts submitted for possible publication to Discrete Optimization should report on original research, should not have been previously published, and should not be under consideration for publication by any other journal.