Browsing by Subject "Stacking Theorem"
Now showing 1 - 1 of 1
- Results Per Page
- Sort Options
Item Pebbling of Oriented Graphs(2017-09) DeVries, Jerad SIn traditional graph pebbling a move across an edge is made by removing two pebbles from one vertex and adding one pebble to an adjacent vertex. We extend this concept to oriented graphs by subtracting three pebbles when moving against an edge orientation and two pebbles when moving with an edge orientation. The cover pebbling number of an oriented graph is the minimum number of pebbles such that given any initial placement of these pebbles we can simultaneously place a pebble on every vertex. In this paper we will look at pebblings of oriented paths.