Feb 21, 2013 · Abstract Given a configuration of indistinguishable pebbles on the vertices of a connected graph G on n vertices, a pebbling move is defined ...
Jan 16, 2013 · When m = 1, it is simply called the pebbling number of a graph. We prove that if G is a graph of diameter d and k, m ≥ 1 are integers, then πm(G) ...
A pebbling move is defined as the removal of two pebbles from some vertex, and the placement of one pebble on an adjacent vertex.
Sep 7, 2018 · Abstract:Pebbling is a game played on a graph. The single player is given a graph and a configuration of pebbles and may make pebbling moves ...
Abstract. Given a configuration of indistinguishable pebbles on the vertices of a connected graph G on n vertices, a pebbling move is defined as the removal ...
Sep 7, 2018 · Pebbling is a game played on a graph. The single player is given a graph and a configuration of pebbles and may make pebbling moves by ...
The m-pebbling number of a graph G, πmG, is the smallest integer k such that for each vertex v and each configuration of k pebbles on G there is a sequence of ...
The m-pebbling number of a graph G, , is the smallest integer k such that for each vertex v and each configuration of k pebbles on G there is a sequence of ...
Aug 15, 2019 · A pebbling move on a graph removes two pebbles from a vertex and adds one pebble to an adjacent vertex. A vertex is reachable from a pebble ...
Missing: Fixed | Show results with:Fixed
Pebbling in graphs was first considered by Chung(1). Consider a connected graph with a fixed number of pebbles distributed on its vertices. A pebbling move ...