Search
Now showing items 1-3 of 3
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 ...
On locating independent domination number of amalgamation graphs
(2018-02-28)
An independent set or stable set is a set of vertices in a graph in which no two
of vertices are adjacent. A set D of vertices of graph G is called a dominating set if every
vertex u 2 V (G) ¡ D is adjacent to some vertex ...
On The LDS of the Joint Product of Graphs
(2019-09-02)
Locating dominating set (LDS) is one of the topics of graph theory.
A set VD
of vertices in graph G is called a dominating set if every
vertex V
u
is either an element of D or adjacent to some element ...