On Roman domination stability in some simple graphs

Authors

  • Mehdi Amraee Islamic Azad University - Department of Mathematics
  • Mohammad Maghasedi Islamic Azad University - Department of Mathematics

Keywords:

domination, Roman domination, Roman domination stability

Abstract

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

2020-07-31

How to Cite

Amraee, M., & Maghasedi, M. (2020). On Roman domination stability in some simple graphs. Italian Journal of Pure and Applied Mathematics, 44, 682–686. Retrieved from https://journals.uniurb.it/index.php/ijpam/article/view/7436

Issue

Section

Articoli - Forum Editrice

Similar Articles

<< < 1 2 3 4 

You may also start an advanced similarity search for this article.