Search
Now showing items 1-1 of 1
A study of local domination number of Sn H graph
(2018-02-28)
All graphs in this paper are undirected, connected and simple graph. Let G = (V,E) be a graph of order |V| and size |E|. We define a set D as a dominating set if for every vertex μ epsilon V – D is adjacent to some vertex ...