Pebbling of Oriented Graphs
2017-09
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Pebbling of Oriented Graphs
Authors
Published Date
2017-09
Publisher
Type
Thesis or Dissertation
Abstract
In 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.
Description
Submitted 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, graphs
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
DeVries, Jerad S. (2017). Pebbling of Oriented Graphs. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/190403.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.