Note on the perfect Roman domination number of graphs

摘要

In this note, we list some propositions of the perfect Roman domination number of graphs and give the characterization of graphs G with special value of the perfect Roman domination. Furthermore, γRp(F)+γRp(F¯) is given. At the last, a linear time algorithm is shown to compute the perfect Roman domination number of a cograph.