Open AccessIndependent Domination Number in Adaptive Mesh Refinement (AMR)-WENO Scheme Networks
Publication year - 2020
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.d1007.1284s519
Subject(s) - vertex (graph theory) , dominating set , combinatorics , mathematics , quadrilateral , domination analysis , set (abstract data type) , discrete mathematics , scheme (mathematics) , graph , topology (electrical circuits) , computer science , physics , mathematical analysis , finite element method , thermodynamics , programming language
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.