Constructions for the Optimal Pebbling of Grids

Author:

Győri Ervin,Katona Gyula Y.,Papp László F.

Abstract

In [6] the authors conjecture that if every vertex of an infinite square grid is reachable from a pebble distribution, then the covering ratio of this distribution is at most 3.25. First we present such a distribution with covering ratio 3.5, disproving the conjecture. The authors in the above paper also claim to prove that the covering ratio of any pebble distribution is at most 6.75. The proof contains some errors. We present a few interesting pebble distributions that this proof does not seem to cover and highlight some other difficulties of this topic.

Publisher

Periodica Polytechnica Budapest University of Technology and Economics

Subject

Electrical and Electronic Engineering,Computer Networks and Communications,Computer Science Applications,Information Systems,Signal Processing,Software

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A new lower bound on the optimal pebbling number of the grid;Discrete Mathematics;2023-01

2. Optimal Pebbling Number of the Square Grid;Graphs and Combinatorics;2020-03-24

3. Optimal pebbling and rubbling of graphs with given diameter;Discrete Applied Mathematics;2019-08

4. The optimal pebbling number of staircase graphs;Discrete Mathematics;2019-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3