Journal
DISCRETE APPLIED MATHEMATICS
Volume 283, Issue -, Pages 133-141Publisher
ELSEVIER
DOI: 10.1016/j.dam.2019.12.020
Keywords
Pebbling; Rubbling; Domination cover rubbling; Total domination cover rubbling
Categories
Ask authors/readers for more resources
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. (C) 2020 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available