The 2-pebbling property of squares of paths and Graham’s conjecture
Abstract A pebbling move on a graph G consists of taking two pebbles off one vertex and placing one pebble on an adjacent vertex. The pebbling number of a connected graph G, denoted by f(G), is the least n such that any distribution of n pebbles on G allows one pebble to be moved to any specified vertex by a sequence of pebbling moves. In this paper, we determine the 2-pebbling property of squares of paths and Graham’s conjecture on $\begin{array}{} P_{2n}^2 \end{array} $.
2019 ◽
Vol 11
(06)
◽
pp. 1950068
2020 ◽
Vol 12
(05)
◽
pp. 2050071
Keyword(s):
Keyword(s):
Keyword(s):
2012 ◽
Vol 04
(04)
◽
pp. 1250055
◽
2019 ◽
Vol 10
(6)
◽
pp. 1322-1331
Keyword(s):
Keyword(s):