DeVries, Jerad S2017-10-022017-10-022017-09https://hdl.handle.net/11299/190403Submitted to the faculty of the Graduate School of the University of Minnesota in partial fulfillment of the requirements for the degree of Master of Science. September, 2017. Major: Mathematics and Statistics. Advisor: Dalibor Froncek. 1 computer file (PDF); vii, 38 pages, graphsIn 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.enPebblingOriented pathsVertexGraph pebblingOriented graphsTraditional pebblingTarget pebblingCover pebblingStacking TheoremDepartment of Mathematics and StatisticsSwenson College of Science and EngineeringUniversity of Minnesota DuluthMaster of SciencePlan Bs (project-based master's degrees)Thesis or Dissertation