Domination cover rubbling

被引：7

作者：

Beeler, Robert A. ^{[1
]}

Haynes, Teresa W. ^{[1
,2
]}

Keaton, Rodney ^{[1
]}

机构：

[1] East Tennessee State Univ, Dept Math, Johnson City, TN 37614 USA

[2] Univ Johannesburg, Dept Pure & Appl Math, Auckland Pk, South Africa

来源：

DISCRETE APPLIED MATHEMATICS | 2019年 / 260卷

关键词：

Graph pebbling; Graph rubbling; Domination cover pebbling; Domination cover nibbling; NUMBER;

D O I：

10.1016/j.dam.2019.01.037

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let G be a connected simple graph with vertex set V and a distribution of pebbles on V. The 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 dominating set of G. We begin by characterizing the graphs having small domination cover rubbling numbers and determining the domination cover rubbling number of several common graph families. We then give a bound for the domination cover rubbling number of trees and characterize the extremal trees. Finally, we give bounds for the domination cover rubbling number of graphs in terms of their domination number and characterize a family of the graphs attaining this bound. Published by Elsevier B.V.

引用

页码：75 / 85

页数：11

共 50 条

[21] A note on the optimal rubbling in ladders and prisms
Xia, Zheng-Jiang
Hong, Zhen-Mu
[J]. arXiv, 2019,
[22] Ice rubbling and ice interaction with offshore facilities
Croasdale, Ken R.
[J]. COLD REGIONS SCIENCE AND TECHNOLOGY, 2012, 76-77 : 37 - 43
[23] 1-RESTRICTED OPTIMAL RUBBLING ON GRAPHS
Beeler, Robert A.
Haynes, Teresa W.
Murphy, Kyle
[J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2019, 39 (02) : 575 - 588
[24] Optimal pebbling and rubbling of graphs with given diameter
Gyori, Ervin
Katona, Gyula Y.
Papp, Laszlo F.
[J]. DISCRETE APPLIED MATHEMATICS, 2019, 266 : 340 - 345
[25] THE DOMINATION COVER PEBBLING NUMBER FOR SOME CYCLIC GRAPHS AND PATH GRAPHS
Lourdusamy, A.
Mathivanan, T.
[J]. ARS COMBINATORIA, 2018, 138 : 51 - 61
[26] Monophonic rubbling number of some standard graphs
Kavitha, K. C.
Jagatheswari, S.
[J]. HELIYON, 2024, 10 (11)
[27] The Optimal Rubbling Number of Paths, Cycles, and Grids
Xia, Zheng-Jiang
Hong, Zhen-Mu
[J]. COMPLEXITY, 2021, 2021
[28] The Optimal Rubbling Number of Paths, Cycles, and Grids
Xia, Zheng-Jiang
Hong, Zhen-Mu
[J]. Complexity, 2021, 2021
[29] Optimal t-rubbling on complete graphs and paths
Sieben, Nandor
[J]. DISCRETE MATHEMATICS LETTERS, 2023, 12 : 86 - 92
[30] Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
Lemanska, Magdalena
Alberto Rodriguez-Velazquez, Juan
Trujillo-Rasua, Rolando
[J]. FUNDAMENTA INFORMATICAE, 2017, 152 (03) : 273 - 287

← 1 2 3 4 5 →