The Optimal Rubbling Number of Paths, Cycles, and Grids

Zheng-Jiang Xia, Zhen-Mu Hong and M. Irfan Uddin

Complexity, 2021, vol. 2021, 1-8

Abstract: A pebbling move on a graph G consists of the removal of two pebbles from one vertex and the placement of one pebble on an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed, which is also called the strict rubbling move. In this new move, one pebble each is removed from u and v adjacent to a vertex w, and one pebble is added on w. The rubbling number of a graph G is the smallest number m, such that one pebble can be moved to each vertex from every distribution with m pebbles. The optimal rubbling number of a graph G is the smallest number m, such that one pebble can be moved to each vertex from some distribution with m pebbles. In this paper, we give short proofs to determine the rubbling number of cycles and the optimal rubbling number of paths, cycles, and the grid P2×Pn; moreover, we give an upper bound of the optimal rubbling number of Pm×Pn.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/5545080.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/5545080.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:5545080

DOI: 10.1155/2021/5545080

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().