Independent Domination Number in Adaptive Mesh Refinement (AMR)-WENO Scheme Networks
2020 ◽
Vol 8
(4S5)
◽
pp. 17-19
Keyword(s):
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.
2020 ◽
Vol 9
(11)
◽
pp. 9335-9339
2020 ◽
Vol 8
(4S5)
◽
pp. 20-23
Keyword(s):
2015 ◽
Vol 23
(2)
◽
pp. 187-199
2018 ◽
Vol 10
(02)
◽
pp. 1850024
Keyword(s):
2020 ◽
Vol 12
(06)
◽
pp. 2050072