INVERSE DOMINATION IN VARIOUS SPECIAL GRAPHS
European Journal of Molecular & Clinical Medicine,
2020, Volume 7, Issue 11, Pages 1697-1707
AbstractIn this paper, the idea of minimal inverse dominating set (IDS) in a graph G(V,E) is presented. A set ofG (V,E) is anIDSof G , if I is the dominating set of the sub graph, D is a minimal dominating set ofthe G. A minimal IDS in a graph G is anIDSthat contains no IDSas a proper subset. A minimum cardinality among all the IDSis an ID number of G(V,E), and it is denoted by . Further theIDS and ID number of various special graphs like Bidiakis cube,Durer graph,Golomb graph and etc. have been discussed.
- Article View: 8
- PDF Download: 17