相关论文: The Pi-Pebbling Function
In a graph G with a distribution of pebbles on its vertices, a pebbling move is the removal of two pebbles from one vertex and the addition of one pebble to an adjacent vertex. A weight function on G is a non-negative integer-valued…
A pebbling move on a graph consists of taking two pebbles off of one vertex and placing one pebble on an adjacent vertex. In the traditional pebbling problem we try to reach a specified vertex of the graph by a sequence of pebbling moves.…
Graph pebbling is the study of moving discrete pebbles from certain initial distributions on the vertices of a graph to various target distributions via pebbling moves. A pebbling move removes two pebbles from a vertex and places one pebble…
A pebbling move on a graph consists of taking two pebbles off from one vertex and add one pebble on an adjacent vertex, the $t$-pebbling number of a graph $G$ is the minimum number of pebbles so that we can move $t$ pebbles on any vertex on…
Given a configuration of pebbles on the vertices of a graph, a pebbling move is defined by removing two pebbles from some vertex and placing one pebble on an adjacent vertex. The cover pebbling number of a graph, gamma(G), is the smallest…
Given a distribution of pebbles on the vertices of a graph G, a {\it pebbling move} takes two pebbles from one vertex and puts one on a neighboring vertex. The {\it pebbling number} \Pi(G) is the minimum k such that for every distribution…
Graph pebbling is a game played on graphs with pebbles on their vertices. A pebbling move removes two pebbles from one vertex and places one pebble on an adjacent vertex. A configuration $C$ is a supply of pebbles at various vertices of a…
Pebbling on graphs is a two-player game which involves repeatedly moving a pebble from one vertex to another by removing another pebble from the first vertex. The pebbling number $\pi(G)$ is the least number of pebbles required so that,…
Let $G=(V,E)$ be a simple graph. A function $\phi:V\rightarrow \mathbb{N}\cup \{0\}$ is called a configuration of pebbles on the vertices of $G$ and the quantity $\sum_{u\in V}\phi(u)$ is called the size of $\phi$ which is just the total…
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 distribution if it is possible to move a pebble to that vertex using pebbling moves. The optimal…
Consider a distribution of pebbles on a connected graph $G$. A pebbling move removes two pebbles from a vertex and places one to an adjacent vertex. A vertex is reachable under a pebbling distribution if it has a pebble after the…
The $t$-fold pebbling number, $\pi_t(G)$, of a graph $G$ is defined to be the minimum number $m$ so that, from any given configuration of $m$ pebbles on the vertices of $G$, it is possible to place at least $t$ pebbles on any specified…
Given a configuration of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex, and the placement of one of these on an adjacent vertex. We introduce the notion of…
Graph pebbling is a network optimization model for transporting discrete resources that are consumed in transit: the movement of two pebbles across an edge consumes one of the pebbles. The pebbling number of a graph is the fewest number of…
Consider a configuration of pebbles distributed on the vertices of a connected graph of order $n$. A pebbling step consists of removing two pebbles from a given vertex and placing one pebble on an adjacent vertex. A distribution of pebbles…
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 removing 2 pebbles from one vertex and placing one at an adjacent vertex to eventually have one pebble…
Given a distribution of pebbles to the vertices of a graph, a pebbling move removes two pebbles from a single vertex and places a single pebble on an adjacent vertex. The pebbling number $\pi(G)$ is the smallest number such that, for any…
Given a configuration of pebbles on the vertices of a graph $G$, a pebbling move removes two pebbles from a vertex and puts one pebble on an adjacent vertex. The pebbling number of a graph $G$ is the smallest number of pebbles required such…
Consider a configuration of pebbles on the vertices of a connected graph. A pebbling move is to remove two pebbles from a vertex and to place one pebble at the neighbouring vertex of the vertex from which the pebbles are removed. For a…
For any configuration of pebbles on the nodes of a graph, a pebbling move replaces two pebbles on one node by one pebble on an adjacent node. A cover pebbling is a move sequence ending with no empty nodes. The number of pebbles needed for a…