Abstract
Let [Formula: see text] be a simple finite and connected graph. A dominating set [Formula: see text] is a strong nonsplit dominating set if the induced subgraph [Formula: see text] is complete. [Formula: see text] is an inverse strong nonsplit dominating set if [Formula: see text] is a strong nonsplit dominating set of [Formula: see text]. The cardinality of minimum inverse strong nonsplit dominating set is the inverse strong nonsplit domination number [Formula: see text]. In this paper, we initiated and introduced a new variant of strong nonsplit dominating set called inverse strong nonsplit dominating set. Also, we obtain the inverse strong nonsplit domination number and bounds of some standard graphs and its complement.
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.
