Resolving Domination Number of Graphs
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 the vertex v and the vertices in W together with their multiplicities. The set W is a res...
Saved in:
Main Authors: | ALFARISI, Ridho (Author), DAFIK, Dafik (Author), KRISTIANA, Arika Indah (Author) |
---|---|
Format: | Academic Paper |
Published: |
Discrete Mathematics, Algorithms and Applications, Vol. 11, No. 6 (2019) 1950071,
2020-06-25T04:50:17Z.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Resolving Domination Numbers of Family of Tree Graph
by: MARDIYA, Regita Triani, et al.
Published: (2020) -
Non-Isolated Resolving Number of Graphs with Homogeneous Pendant Edges
by: Alfarisi, Ridho, et al.
Published: (2018) -
The 2-Distance Chromatic Number of Some Wheel Related Graphs
by: KRISTIANA, Arika Indah, et al.
Published: (2020) -
Bound of Distance Domination Number of Graph and Edge Comb Product Graph
by: Gembong A.W, et al.
Published: (2017) -
The Local Multiset Dimension of Graphs
by: Alfarisi, Ridho, et al.
Published: (2019)