Distance restricted optimal pebbling in paths

被引：0

作者：

Shiue, Chin-Lin ^{[1
]}

机构：

[1] Chung Yuan Christian Univ, Dept Appl Math, 200 Chung Pei Rd, Taoyuan 32023, Taiwan

来源：

DISCRETE APPLIED MATHEMATICS | 2021年 / 297卷

关键词：

Pebbling; Path; Cycle;

D O I：

10.1016/j.dam.2021.02.036

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let P-n be a path with n vertices. In this article, we use linear programming to obtain two sharp lower bounds for the optimal (1, t)-pebbling number of P-n and then determine the exact value if t is even or t = 1 or t >= [n/2] - 1. (C) 2021 Elsevier B.V. All rights reserved.

引用

页码：46 / 54

页数：9