Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
