Perfect Roman domination in graphs

Abstract A perfect Roman dominating function on a graph G is a function f : V ( G ) ⟶ { 0 , 1 , 2 } having the property that for every vertex u with f ( u ) = 0 , there exists exactly one vertex v such that u v ∈ E ( G ) and f ( v ) = 2 . The weight of f, denoted by w ( f ) , is the value ∑ v ∈ V ( G ) f ( v ) . Given a graph G and a positive integer k, the perfect Roman domination problem is to decide whether there is a perfect Roman dominating function f on G such that w ( f ) is at most k. In this paper, we first show that the perfect Roman domination problem is NP -complete for chordal graphs, planar graphs, and bipartite graphs. Then we present polynomial time algorithms for computing a perfect Roman dominating function with minimum weight in block graphs, cographs, series-parallel graphs, and proper interval graphs.

[1]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[2]  Charles S. Revelle,et al.  Defendens Imperium Romanum: A Classical Problem in Military Strategy , 2000, Am. Math. Mon..

[4]  Stephen T. Hedetniemi,et al.  Roman domination in graphs , 2004, Discret. Math..

[5]  Teresa W. Haynes,et al.  Double Roman domination , 2016, Discret. Appl. Math..

[6]  Tohru Kikuno,et al.  A linear algorithm for the domination number of a series-parallel graph , 1983, Discret. Appl. Math..

[7]  Bhawani Sankar Panda,et al.  A linear time recognition algorithm for proper interval graphs , 2003, Inf. Process. Lett..

[8]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..

[9]  Teresa W. Haynes,et al.  Roman {2}-domination , 2016, Discret. Appl. Math..

[10]  Vladimir Samodivkin,et al.  Signed Roman domination in graphs , 2014, J. Comb. Optim..

[11]  I. Stewart.  Defend the Roman Empire , 1999 .

[12]  Gary MacGillivray,et al.  Perfect Roman domination in trees , 2018, Discret. Appl. Math..

[13]  Lorna Stewart,et al.  A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..