Baghdad Science Journal · 2021 · 16 citations · 9 references
Natural SciencesComputer ScienceMathematicsCombinatoricsComputational GeometryGeometryGraph AlgorithmsGraph TheoryDominating SetsGraph DiameterMetric Graph Theory
The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs and , for some special graphs . The dominant metric dimension of is denoted by and the dominant metric dimension of corona product graph G and H is denoted by .
9
Resolvability in graphs and the metric dimension of a graph
Gary Chartrand, Linda Eroh, Mark A. Johnson et al. · Discrete Applied Mathematics · 2000 · 982 citations
On the Metric Dimension of Cartesian Products of Graphs
José Cáceres, Carmen Hernando, Mercè Ferrater Mora et al. · SIAM Journal on Discrete Mathematics · 2007 · 474 citations · Full text
Resolving domination in graphs
Robert C. Brigham, Gary Chartrand, Ronald D. Dutton et al. · Mathematica Bohemica · 2003 · 128 citations · Full text
The dominant metric dimension of graphs
Liliek Susilowati, Imroatus Sa’adah, Ratna Zaidatul Fauziyyah et al. · Heliyon · 2020 · 34 citations · Full text