Covering cover pebbling number of products of paths

Loading...
Thumbnail Image

Persistent link to this item

Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

Covering cover pebbling number of products of paths

Published Date

2015-05

Publisher

Type

Thesis or Dissertation

Abstract

There are a variety of pebbling numbers, such as classical pebbling number, cover pebbling number, and covering cover pebbling number. In this paper we determine the covering cover pebbling number for Cartesian products of paths. The covering cover pebbling number of a graph, G, is the smallest number of pebbles, n, required such that any distribution of n pebbles onto the vertices of G can be, through a sequence of pebbling moves, redistributed so that C, a vertex cover of G, is pebbled. Traditionally, a pebbling move is defined as the removal of two pebbles from one vertex and the placement of one pebble on an adjacent vertex. In this paper we provide an alternative proof for the covering cover pebbling number of cycles and prove the covering cover pebbling number for a Cartesian product of paths.

Description

University of Minnesota M.S. thesis. May 2015. Major: Applied and Computational Mathematics. Advisors: Dalibor Froncek, Sylwia Cichacz-Przenioslo. 1 computer file (PDF); iii, 34 pages.

Related to

Replaces

License

Series/Report Number

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Suggested citation

McGahan, Ian. (2015). Covering cover pebbling number of products of paths. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/174812.

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.