Abstract
A graph has a vertex set and edge set and . A non - empty subset D is an independent dominating set if every vertex in is adjacent a vertex in and is a non – adjacent vertices. The domination number is the minimum cardinality of an independent dominating set. If, in addition let and be the element of . Then weakly dominates if (i) and (ii) . A set S is a weak non-split dominating set of if every vertex is is weakly dominated by at least one vertex in and the induced subgraph is connected. The minimum cardinality of a weak non-split independent dominating set is the weak non-split independent domination number of G .The main purpose of this paper is to introduce the concept of weak non-split independent domination number. For that we have chosen Soifer graph, Chvatal graph, Fritsch graph, Herschel graph, Moser graph, Franklin graph to find the weak non-split domination number.
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.
