Abstract
Let [Formula: see text] be a simple graph of order [Formula: see text]. A set [Formula: see text] is said to be a restrained set if each vertex in [Formula: see text] is adjacent to a vertex in [Formula: see text]. The restrained polynomial of a graph [Formula: see text] is [Formula: see text] where [Formula: see text] is the number of restrained sets of [Formula: see text] of cardinality [Formula: see text]. A set [Formula: see text] is said to be a restrained dominating set if each vertex in [Formula: see text] is adjacent to a vertex in [Formula: see text] and to a vertex in [Formula: see text]. The restrained domination polynomial of a graph [Formula: see text] is defined by [Formula: see text] where [Formula: see text] is the number of restrained dominating sets of [Formula: see text] of cardinality [Formula: see text]. In this paper, we derive restrained domination polynomial of join and corona of any two 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.
