Open AccessResolving domination number of helm graph and it’s operation
Author(s) -
A. N. Hayyu,
Dafik Dafik,
I Made Tirta,
Robiatul Adawiyah,
R. M. Prihandini
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1465/1/012022
Subject(s) - dominating set , combinatorics , metric dimension , mathematics , vertex (graph theory) , domination analysis , graph , discrete mathematics , cardinality (data modeling) , connectivity , computer science , line graph , pathwidth , data mining
Let G be a connected graph. Dominating set is a set of vertices which each vertex D has at least one neighbor in G . The minimum cardinality of D is called the domination number G ( γ ( G )). The metric dimension of G is the minimum cardinality of a series of vertices so that each vertex G is uniquely. It is determined by the distance of vector to the selected vertices. A dominating metric dimension set is a set of vertices has a dominating set D which has condition of metric dimension. The minimum cardinality is called the resolving domination number of G , ( Dom Dim ( G )). We analyze the resolving domination number of helm graph and it’s operation. We study combine the existence concept of dominating set and metric dimension. We have obtained the minimum cardinality of dominating number.