Total domination cover rubbling

Robert A. Beeler; Teresa W. Haynes; Michael A. Henning; Rodney Keaton

doi:10.1016/j.dam.2019.12.020

Total domination cover rubbling

Robert A. Beeler, Teresa W. Haynes, Michael A. Henning, Rodney Keaton

Mathematics and Applied Mathematics

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	133-141
Number of pages	9
Journal	Discrete Applied Mathematics
Volume	283
DOIs	https://doi.org/10.1016/j.dam.2019.12.020
Publication status	Published - 15 Sept 2020

Keywords

Domination cover rubbling
Pebbling
Rubbling
Total domination cover rubbling

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2019.12.020

Cite this

@article{336760ed3cc24802bcd047d645448d77,

title = "Total domination cover rubbling",

abstract = "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.",

keywords = "Domination cover rubbling, Pebbling, Rubbling, Total domination cover rubbling",

author = "Beeler, {Robert A.} and Haynes, {Teresa W.} and Henning, {Michael A.} and Rodney Keaton",

note = "Publisher Copyright: {\textcopyright} 2020 Elsevier B.V.",

year = "2020",

month = sep,

day = "15",

doi = "10.1016/j.dam.2019.12.020",

language = "English",

volume = "283",

pages = "133--141",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

}

TY - JOUR

T1 - Total domination cover rubbling

AU - Beeler, Robert A.

AU - Haynes, Teresa W.

AU - Henning, Michael A.

AU - Keaton, Rodney

PY - 2020/9/15

Y1 - 2020/9/15

N2 - 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.

AB - 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.

KW - Domination cover rubbling

KW - Pebbling

KW - Rubbling

KW - Total domination cover rubbling

UR - http://www.scopus.com/inward/record.url?scp=85077757408&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2019.12.020

DO - 10.1016/j.dam.2019.12.020

M3 - Article

AN - SCOPUS:85077757408

SN - 0166-218X

VL - 283

SP - 133

EP - 141

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

Total domination cover rubbling

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this