Let G be a connected simple graph with vertex set V and a distribution of pebbles on the vertices of V. The total domination cover rubbling number of G is the minimum number of pebbles, so that no matter how they are distributed, it is possible that after a sequence of pebbling and rubbling moves, the set of vertices with pebbles is a total dominating set of G. We investigate total domination cover rubbling in graphs and determine bounds on the total domination cover rubbling number.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-10406 |
| Date | 15 September 2020 |
| Creators | Beeler, Robert A., Haynes, Teresa W., Henning, Michael A., Keaton, Rodney |
| Publisher | Digital Commons @ East Tennessee State University |
| Source Sets | East Tennessee State University |
| Detected Language | English |
| Type | text |
| Source | ETSU Faculty Works |
Page generated in 0.0021 seconds