Roman and inverse Roman domination in graphs
Zulfiqar Zaman, Mehul Kumar, Saad Salman Ahmad · Notes on Number Theory and Discrete Mathematics · 2018
Motivated by the article in Scientific American[8], Michael A Henning and Stephen T. Hedetniemi explored the strategy of defending the Roman Empire.Cockayne defined Roman dominating function (RDF) on a GraphThen f 1 is called inverse Roman dominating function (IRDF) on a graph G w.r.t.f.The inverse Roman domination number (IRDN) denoted by γ 1 R(G) is the minimum weight among all IRDF in G.In this paper we find few results of RDN and IRDN.