Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"graph pebbling"”.
-
Generalizations and Variations on Graph Pebbling
Graph pebbling involves determining the minimum number of pebbles needed so that regardless of the initial arrangement of pebbles on a graph, a pebble can be moved to any vertex using specified ``pebbling moves.'' This minimum number of pebbles is the pebbling number of a graph. We begin by making …
-
On the Pebbling Numbers of Graphs
Graph pebbling is an application which has evolved from the study of graph theory. The goal of pebbling in a graph is to use pebbling steps to move one pebble onto a designated root vertex. A pebbling step is produced by taking two pebbles from a vertex, moving one of them to an adjacent vertex, …