On Roman domination stability in some simple graphs
Keywords:
domination, Roman domination, Roman domination stabilityAbstract
The Roman domination stability of a graph G, denoted by stγ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.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 Mehdi Amraee, Mohammad Maghasedi

This work is licensed under a Creative Commons Attribution 4.0 International License.
L'opera è pubblicata sotto Licenza Creative Commons Attribuzione 4.0 Internazionale (CC-BY)

