On Metric Dimension of Edge Comb Product of Symmetric Graphs
DOI:
https://doi.org/10.25077/jmua.13.4.349-357.2024Keywords:
Edge Comb Product, Symmetric, Metric DimensionAbstract
Consider a finite graph G that is simple, undirected, and connected. Let W be an ordered set of vertices with |W| = k. The representation of a vertex v is defined as an ordered k-tuple that consists of the distances from vertex v to each vertex in W. The set W is called a resolving set for G if the k-tuples for any two vertices in G are distinct. The metric dimension of G, denoted by dim(G), is the smallest possible size of such a set W. In this paper, we determine the metric dimension of edge comb product of trees with complete multipartites or petersen graphs.References
Akhter, S., Farooq, R., 2019, Metric dimension of fullerene graphs, Electron. J. Graph Theory Appl., Vol. 7(1): 91–103
Chandran, S., Reji, T., 2024, Edge metric dimension of some Cartesian product of graphs, Proyecciones: J. Math, Vol. 43(3): 587–611
Chartrand, G., Eroh, L., Johnson, M.A., Oellermann, O.R., 2000, Resolvability in graphs and the metric dimension of a graph, Discrete Appl. Math., Vol. 105: 99–113
Dudenko, M., Oliynyk, B. 2018, On unicyclic graphs of metric dimension 2 with vertices of degree 4, Algebra Discrete Math., Vol. 26(2): 256–269
Harary, F., Melter, R., 1976, On the metric dimension of a graph, Ars Combin., Vol. 2: 191–195
Kuziak, D., Yero, I.G., 2021, Metric dimension related parameters in
graphs: A survey on combinatorial, computational and applied results,
arXiv:2107.04877v1
Javaid, I., Rahim, M.T., Ali, K., 2008, Families of regular graphs with constant metric dimension, Utilitas Mathematica, Vol. 65: 21–33
Kurnia, R., Abrar, A.M., Syarifudin, A.G., Wijaya, V.R., Supu, N.A., Suwastika, E., 2023, On properties of prime ideal graphs of commutative rings, Barekeng: J. Math. Appl., Vol. 17(3): 1463–1472
Maryati, T.K., Sobiruddin, D., Fatra, M., Hadiputra, F.F., 2024+, On
metric dimension of edge comb product of vertex-transitive graphs,
https://toc.ui.ac.ir/article 28255.html, in press.
Redmond, S., Szabo, S., 2021, When metric and upper dimensions differ in zero divisor graphs of commutative rings, Discrete Math. Lett., Vol. 5: 34–40
Rinurwati, Maharani, F.D., 2024, Bi-edge metric dimension of graphs, Int. J. Comput. Sci. Appl. Math., Vol. 10(1): 38–40
Slater, P., 1975, Leaves of trees, Proc. 6th Southeastern Conf. on Comb. Graph Theory Comput., Vol. 14: 549–559
Slamin, Dafik, Waspodo, A.G., 2018, Distance domination number of graphs resulting from edge comb product, J. Phys.: Conf. Ser., Vol. 1022: 012008
Tillquist, R.C., Frongillo, R.M., Lladser, M.E., 2021, Getting the lay of the
land in discrete space: A survey of metric dimension and its applications, arXiv:2104.07201v1
Wijaya, K., 2022, Dimensi metrik dari graf hasil identifikasi, J. Mat. UNAND, Vol. 11(3): 199–209
Yulianti, L., Welyyanti, D., Yanita, Fajri, M.R., Saputro, S.W., 2023, On the metric dimension of Buckminsterfullerene-net graph, Indones. J. Combin., Vol. 7(2): 63–72
Downloads
Additional Files
Published
Issue
Section
License
All articles published in Jurnal Matematika UNAND (JMUA) are open access and licensed under the Creative Commons Attribution-ShareAlike (CC BY-SA) license. This ensures that the content is freely available to all users and can be shared and adapted, provided appropriate credit is given and any adaptations are distributed under the same license.
Copyright Holder
The copyright of all articles published in Jurnal Matematika UNAND is held by the Departemen Matematika dan Sains Data, Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA), Universitas Andalas (UNAND). This applies to all published versions, including the HTML and PDF formats of the articles.
Author Rights
While the Departemen Matematika dan Sains Data FMIPA UNAND holds the copyright for all published content, authors retain important rights under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA). This license grants authors and users the following rights:
- Reuse: Authors can reuse and distribute their work for any lawful purpose, including sharing on personal websites, institutional repositories, or in subsequent publications.
- Attribution and Adaptation: Authors and others may remix, adapt, and build upon the published work for any purpose, even commercially, as long as proper credit is given to the original authors, and any derivative works are distributed under the same CC BY-SA license.
Creative Commons License (CC BY-SA)
Under the terms of the CC BY-SA license, users are free to:
- Share: Copy and redistribute the material in any medium or format.
- Adapt: Remix, transform, and build upon the material for any purpose, even commercially.
However, the following conditions apply:
- Attribution: Users must give appropriate credit to the original author(s) and Departemen Matematika dan Sains Data FMIPA UNAND, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author or the journal.
- ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same license as the original.
For more information about the CC BY-SA license, please visit the Creative Commons website.
Third-Party Content
If authors include third-party material (such as figures, tables, or images) that is not covered by a Creative Commons license, they must obtain the necessary permissions for reuse and provide proper attribution. Authors are required to ensure that any third-party content complies with open-access licensing requirements or includes permissions for redistribution under similar terms.
Copyright and Licensing Information Display
The copyright and licensing terms will be clearly displayed on each article's landing page, as well as within the full-text versions (HTML and PDF) of all published articles.
No "All Rights Reserved"
As an open-access journal, JMUA does not use "All Rights Reserved" policies. Instead, the CC BY-SA license ensures that the works remain accessible and reusable for a wide audience while still protecting both the authors' and the copyright holder's rights.
Â









