Abstract
In this paper, we introduced an inverse split majority dominating set of a graph \(G\). Inverse split majority domination number \({\gamma }^{-1}_{SM}(G)\) is determined for some classes of graphs. Some important results and characterization theorems on \({\gamma }^{-1}_{SM}(G)\) are established. Many Bounds on inverse split majority domination number and its relationship with other domination parameters are also obtained.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.