Abstract
dc:description.abstractFor a graph G = (V;E), a pebble distribution is defined as a mapping of the vertex set in to the integers, where each vertex begins with f(v) pebbles. A pebbling move takes two pebbles from some vertex adjacent to v and places one pebble on v. A rubbling move takes one pebble from each of two vertices that are adjacent to v and places one pebble on v. A vertex x is reachable under a pebbling distribution f if there exists some sequence of rubbling and pebbling moves that places a pebble on x. A pebbling distribution where every vertex is reachable is called a rubbling configuration. The t-restricted optimal rubbling number of G is the minimum number of pebbles required for a rubbling configuration where no vertex is initially assigned more than t pebbles. Here we present results on the 1-restricted optimal rubbling number and the 2- restricted optimal rubbling number.
Degree
thesis:*- Name thesis:degree_name
- MS (Master of Science)
- Level thesis:degree_level
- Dissertation - unrestricted
- Discipline thesis:degree_discipline
- Mathematical Sciences
- Grantor dc:publisher
- East Tennessee State University
- Year dc:date.issued
- 2017
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Murphy, Kyle
Subjects
dc:subject × 4Rights
dc:rights- Statement dc:rights
-
- Copyright by the authors.
- Language dc:language
- eng
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://dc.etsu.edu/etd/3251