TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

On the central resolver set of the edge coronation graphs

* , , , , ,

* Corresponding author · click or hover a name for details

pp. 29–42Vol. 28Issue 1February 2025DOI: 10.47974/JDMSC-1819 Crossmark XML
Received:
14 Dec 2022
Published Online:
28 Feb 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-1819
Pages:
29–42

Abstract

Graph theory as part of mathematics, has experienced significant development from the theoretical aspect, one of it is the theory of metric dimension. The concept of metric dimensions has evolved greatly, including the dominant metric dimension and the complement metric dimension. In this study, the concept of the central metric dimension is introduced, that is a combination of the metric dimension and central of a graph. The minimum number of vertices of a resolver set that contains a central set is called the central metric dimension of graph G, and denoted by dimcen(G). Several characterizations of a graph having a certain central metric dimension are yielded in this study. Several relations are obtained between the central metric dimension and the metric dimension. Furthermore, the central metric dimension is applied on edge coronation graphs. The edge coronation of graphs G and H is denoted by (G ◊ H). The results of the study show that the central metric dimension of edge coronation of G and H are influenced by the central set and the order of graph G and the metric dimension of graph H. 

Keywords

Subject Classifications

05C1205C7505C38

References

[1] Z. Ahmad, M. A. Chaudhary, A. Q. Baig, and M. A. Zahid, “Fault-tolerant metric dimension of P(n,2)° K1 graph,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 24, no. 2, pp. 647-656 (2021).
[2] C. Brigham, R. D. Dutton, G. Chartrand, and P. Zhang, “Resolving domination in graphs,” Mathematica Bohemica, vol. 128, no. 1, pp. 25-36 (2003).
[3] G. Chartrand, L. Eroh, M. A. Johnson, and O. R. Oellermann, “Resolvability in graphs and the metric dimension of a graph,” Discrete Applied Mathematics, vol. 105, pp. 99-113 (2000).
[4] G. Chartrand, L. Lesniak, and P. Zhang, Graphs and Digraphs, 3rd ed. Florida: Chapman & Hall/CRC (2000).
[5] F. Harary, Graph Theory, Addison-Wesley Publishing Company, London, pp. 35-36 (1969).
[6] F. Harary and R. A. Melter, “On the metric dimension of a graph,” ARS Combinatoria, vol. 2, pp. 191-195 (1976).
[7] M. A. Henning and O. R. Oellermann, “Metric locating dominating sets in graphs,” Ars Combinatoria, vol. 73, pp. 129-141 (2004).
[8] H. Iswadi, E. T. Baskoro, R. Simanjuntak, and A. N. M. Salman, “The metric dimension of graph with pendant edges,” The Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 65, pp. 139-145 (2008).
[9] H. Iswadi, E. T. Baskoro, and R. Simanjuntak, “On the metric dimension of corona product graphs,” Far East Journal of Mathematical Sciences, vol. 52, no. 2, pp. 155-170 (2011).
[10] P. J. Slater, “Leaves of trees,” Congressus Numerantium, vol. 14, pp. 549-559 (1975).
[11] B. Sooryanarayana, S. Kunikullaya, and N. Narasimha Swamy, “Metric dimension of generalized wheels,” Arab Journal of Mathematical Sciences, vol. 25, no. 2, pp. 131-144 (2019).
[12] L. Susilowati, I. Saadah, Fauziyyah, R. Z. Erfanian, and S. Slamin, “The dominant metric dimension of graphs,” Heliyon, vol. 6, pp. 1-6 (2020).
[13] L. Susilowati, S. Zahidah, R. D. Nastiti, and M. I. Utoyo, “The metric dimension of k-subdivision graphs,” Journal of Physics: Conference Series, vol. 1494, no. 127, May (2020).
[14] L. Susilowati, N. Atmim, and D. P. Utami, “The complement metric dimension of the joint graph,” in Proceedings of the International Conference on Mathematics, Computational Sciences, and Statistics, Surabaya, Indonesia, Sep. 29, 2020, AIP Conference Proceedings, vol. 2329, pp. 020003 (2021).
[15] P. S. Buczkowski, G. Chartrand, C. Poisson, and P. Zhang, “On k-dimensional graphs and their bases,” Periodica Mathematica Hungaria, vol. 46, no. 1, pp. 9-15 (2003).
[16] C. Hernando, M. Mora, I. M. Pelayo, C. Seara, J. Careres, and M. L. Puertas, “On the metric dimension of some families of graphs,” Electronic Notes in Discrete Mathematics, vol. 22, pp. 123-133 (2005).

Views: 299Downloads: 6Citations: 1