INDEPENDENT DOMINATION NUMBER (IDN) FOR SOME SPECIAL NETWORKS IN ADAPTIVE MESH REFINEMENT (AMR)-WENO SCHEME

N. Senthurpriya, S. Meenakshi, P. Punithavathi

  DOI:  https://doi.org/10.37418/amsj.9.11.38

Full Text

Let G(V,E) be a graph, V has a subset C, this set is an non-empty subset of V and the vertices in C is adjacent to the minimum of one vertex of the set V, then G has the dominating set C. If there is no adjacency between the vertices of C, then G has an independent dominating set C and so the number of vertices present in the set C represents the IDN, the minimum cardinality of the sets C. Here in our research, we find the same for some special networks, namely the polygons with nine, ten and eleven sides by above mentioned Scheme.

Keywords: ID, IDN, Domination, Adaptive Mesh Refinement (AMR), WENO Scheme.