On Roman domination stability in some simple graphs

被引：0

作者：

Amraee, Mehdi ^{[1
]}

Maghasedi, Mohammad ^{[1
]}

机构：

[1] Islamic Azad Univ, Karj Branch, Dept Math, Karaj, Iran

来源：

ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS | 2020年 / 44期

关键词：

domination; Roman domination; Roman domination stability;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The Roman domination stability of a graph G, denoted by st(gamma R)(G), is the minimum number of vertices whose removal changes the Roman domination number of G. In this paper, we continue the study of this concept, and determine the Roman domination stability of some classes of graphs, including paths, cycles, complete bipartite graphs and some Cartesian products of paths and complete graphs.

引用

页码：682 / 686

页数：5

共 6 条

[1] Amraee M, 2019, MATH REP, V21, P193
[2] DOMINATION ALTERATION SETS IN GRAPHS
BAUER, D
HARARY, F
NIEMINEN, J
SUFFEL, CL
[J]. DISCRETE MATHEMATICS, 1983, 47 (2-3) : 153 - 161
[3] Roman domination in graphs
Cockayne, EJ
Dreyer, PA
Hedetniemi, SM
Hedetniemi, ST
[J]. DISCRETE MATHEMATICS, 2004, 278 (1-3) : 11 - 22
[4] Rad NJ, 2013, UTILITAS MATHEMATICA, V92, P73
[5] Defendens imperium romanum: A classical problem in military strategy
ReVelle, CS
Rosing, KE
[J]. AMERICAN MATHEMATICAL MONTHLY, 2000, 107 (07) : 585 - 594
[6] Defend the Roman Empire!
Stewart, I
[J]. SCIENTIFIC AMERICAN, 1999, 281 (06) : 136 - +

← 1 →