Modeling Network Problem using Metric Dimension: Applied Algorithm on Corona Graph
Mathematical Journal of Modelling and Forecasting · 2024
DOI: 10.24036/mjmf.v2i1.21 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical Journal of Modelling and Forecasting, 2024. Verfasst von Deddy Rahmadi und 3 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-SA 4.0).
Abstract (Originalsprache)
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.
Zitieren
APA
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. https://doi.org/10.24036/mjmf.v2i1.21
Vancouver
Rahmadi D, Ramadhani IN, Dheana CE, Mustamin MA. Modeling Network Problem using Metric Dimension: Applied Algorithm on Corona Graph. Mathematical Journal of Modelling and Forecasting. 2024. doi:10.24036/mjmf.v2i1.21
BibTeX
@article{Rahmadi2024,
author = {Rahmadi, Deddy and Ramadhani, Ilma Nindita and Dheana, Clarissa Elva and Mustamin, Miftah Aulia},
title = {Modeling Network Problem using Metric Dimension: Applied Algorithm on Corona Graph},
journal = {Mathematical Journal of Modelling and Forecasting},
year = {2024},
doi = {10.24036/mjmf.v2i1.21}
}
EUVIMED