Author : S.Velammal 1
Date of Publication :20th April 2018
Abstract: Strong (G,D)-number of Graphs was introduced by Palani K and Santhaana Gomathi C. Let G be a (V,E) graph. A dominating set is said to be a strong dominating set of G if it strongly dominates all the vertices of its complement. A (G,D)-set D of G is said to be a strong (G,D)-set of G if it strongly dominates all the vertices of V-D. In this paper, we find the strong (G,D)-number of product graphs of some standard graphs
Reference :