Search
Now showing items 1-1 of 1
Resolving Domination Number of Graphs
(Discrete Mathematics, Algorithms and Applications, Vol. 11, No. 6 (2019) 1950071, 2019-11-05)
For a set W =
{
s1,s2,...,sk
of vertices of a graph G, the representation multiset of
a vertexv of G with respect to W is r(v
|
W ) =
{
d(v, s1),d(v, s2),...,d(v, sk)
}
, where
d(v, si) is a distance between of ...