Resolving domination number of helm graph and it’s operation

Autor:	Dafik, R. M. Prihandini, Robiatul Adawiyah, A. N. Hayyu, I. M. Tirta
Rok vydání:	2020
Předmět:	Combinatorics History Domination analysis Graph (abstract data type) Computer Science Applications Education Mathematics
Zdroj:	Journal of Physics: Conference Series. 1465:012022
ISSN:	1742-6596 1742-6588
DOI:	10.1088/1742-6596/1465/1/012022
Popis:	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, (DomDim (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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::3dd28b9e743bc07319e77a29e94fc805 https://doi.org/10.1088/1742-6596/1465/1/012022 Zobrazit plný text záznamu