Abstract
Let G be the graph, consider the vertex set as V and edge set as E. If S is the subset of the vertex set V such that S contains vertices which has atleast one neighbor in V that is not in S, then S is said to be dominating set of G. If the vertex in S is not adjacent to one another, then S is called as the independent dominating set of G and so i(G) represents the independent domination number, the minimum cardinality of an independent dominating set in G. In this paper, we obtain independent domination number for triangular, quadrilateral, pentagonal, hexagonal, heptagonal and octagonal networks by Adaptive Mesh Refinement (AMR)-WENO Scheme.
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.
