Dimensi Metrik Graf Dual Prisma
Abstract
The form of a graph which formed from a graph has no intersecting side is called a dual graph. One graph that can be formed as a dual graph is a prism graph. Prism graph (Pm,n) is a graph formed from the results of a cartesian product of a cycle graph with a line graph. In this paper we discuss the metric dimension of a dual prism graph (P'm,n). The metric dimension of a dual prism graph is divided into two states, when n = 2 and n ≥ 3.
References
[2] Bringham, R., Chartrand, G., Dutton, R. D., & Zhang, P. (2003). Resolving Domination In Graphs. Mathematica Bohemica, 128(1), 25-36.
[3] Chartrand, G., Eroh, L., Johnson, M. A., & Oellermann, O. R. (2000). Resolvability in graphs and the metric dimension of a graph. Discrete Applied Mathematic, 105, 99-113.
[4] Hindayani. (2011, Mei). Dimensi Metrik Graf Kr + mKs, m,r,s elemen N. CAUCHY, 1(4), 165-174.
[5] Lakshmi, S., & Saranya, N. (2014). Self-Dual and Characterization of Partial Dual Graphs. IOSR Journal of Mathematics (IOSR-JM), 10(6), 14-25.
[6] Mussafi, N. S. (2015, April). Penerapan Greedy Coloring Algorithm Pada Peta Kotamadya Yogyakarta Berbasis Four-Colour Theorem. Kaunia, XI(1), 19-26.
[7] Pathak, R., & Kalita, B. (2012). Properties of Some Euler Graphs Constructed from Euler Diagram. Int. Journal of Applied Sciences and Engineering Research, I(2), 232-237.
[8] Permana, A. B., & Darmaji. (2012). Dimensi Metrik Graf Pohon Bentuk Tertentu. JURNAL TEKNIK POMITS, 1(1), 1-4.
[9] Saifudin, I. (2016, Agustus). Dimensi Metrik dan Dimensi Partisi dari Famili Graf Tangga. JUSTINDO, Jurnal Sistem & Teknologi Informasi Indonesia, 1(2), 105-112.
[10] Sulistio, W., Slamin, & Dafik. (2015, Desember). Analisis Dimensi Metrik Dengan Himpunan Pembeda Terhubung Pada Graf Khusus Keluarga Pohon Dikaitkan Keterampilan Berpikir Tingkat Tinggi. Kadikma, 6(3), 26-35.
[11] Utomo, T., & Dewi, N. R. (2018, Maret). Dimensi Metrik Graf Amal (nKm). Limits: Journal Mathematics and Its Application, 15(1), 71-77.
[12] Yuan, W., He, K., Guan, D., & Han, G. (2017). Edge-Dual Graph Preserving Sign Prediction for Signed Social Networks. IEEE Access, 5, 19383-19392.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish in UJMC (Unisda Journal of Mathematics and Computer Science) agree to the following terms:
1.Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
2.Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
3.Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.