Abstract
Let [Formula: see text] be a finite and simple graph of order [Formula: see text] and maximum degree [Formula: see text]. A signed strong Roman dominating function on a graph [Formula: see text] is a function [Formula: see text] satisfying the conditions that (i) for every vertex [Formula: see text] of [Formula: see text], [Formula: see text], where [Formula: see text] is the closed neighborhood of [Formula: see text] and (ii) every vertex [Formula: see text] for which [Formula: see text] is adjacent to at least one vertex [Formula: see text] for which [Formula: see text], where [Formula: see text]. The minimum of the values [Formula: see text], taken over all signed strong Roman dominating functions [Formula: see text] of [Formula: see text], is called the signed strong Roman domination number of [Formula: see text] and is denoted by [Formula: see text]. In this paper, we continue the study signed strong Roman domination number of a graph and give several bounds for this parameter. Then, among other results, we determine the signed strong Roman domination number of special classes of graphs.
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.
