Modeling Network Problem using Metric Dimension: Applied Algorithm on Corona Graph

Deddy Rahmadi; Ilma Nindita Ramadhani; Clarissa Elva Dheana; Miftah Aulia Mustamin

doi:10.24036/mjmf.v2i1.21

Modeling Network Problem using Metric Dimension: Applied Algorithm on Corona Graph

Authors

Deddy Rahmadi Universitas Islam Negeri Sunan Kalijaga Yogyakarta
Ilma Nindita Ramadhani Universitas Islam Negeri Sunan Kalijaga Yogyakarta
Clarissa Elva Dheana Universitas Islam Negeri Sunan Kalijaga Yogyakarta
Miftah Aulia Mustamin Universitas Islam Negeri Sunan Kalijaga Yogyakarta

DOI:

https://doi.org/10.24036/mjmf.v2i1.21

Keywords:

Graph Theory, Modelling, Metric Dimension, Network, Corona Graph

Abstract

Let G be a graph is a finite set of vertices and edges. A graph G can be defined as a pair of sets . The minimum cardinality of all distinguishing sets in a graph is called the metric dimension. The metric dimension was first introduced in 1966 by Harary and Melter. The method used in this research is deductive proof. The results obtained from this research are we determine the metric dimension of the graph resulting from the corona operation on and obtain the result that is 2n.

Downloads

Published

2024-07-06

How to Cite

Rahmadi, D., Ramadhani, I. N., Dheana, C. E., & Mustamin, M. A. (2024). Modeling Network Problem using Metric Dimension: Applied Algorithm on Corona Graph. Mathematical Journal of Modelling and Forecasting, 2(1), 20–26. https://doi.org/10.24036/mjmf.v2i1.21