Advances and Applications in Discrete Mathematics

The Advances and Applications in Discrete Mathematics is a prestigious peer-reviewed journal indexed in the Emerging Sources Citation Index (ESCI). It is dedicated to publishing original research articles in the field of discrete mathematics and combinatorics, including topics such as graphs, coding theory, and block design. The journal emphasizes efficient and powerful tools for real-world applications and welcomes expository articles that highlight current developments in the field.

Submit Article

ON SOME SPECIAL TREES WITH RESPECT TO THE CONNECTED METRIC DIMENSION OF GRAPHS

Authors

  • Yasser M. Hausawi
  • Mohammed El-Meligy
  • Zaid Alzaid
  • Olayan Alharbi
  • Badr Almutairi
  • Basma Mohamed

Keywords:

metric dimension, basis, connected resolving set, subdivision of a graph

DOI:

https://doi.org/10.17654/0974165824044

Abstract

The idea of a minimal resolving set has been used in a variety of contexts, including coin weighing, mastermind games, robot navigation, networking, and optimization. An NP-complete problem is determining the connected metric dimension of a given graph. In this study, we determine the exact value of the connected metric dimension for a number of trees, including Y-tree network, subdivision of Y-tree network, F-tree network, a subdivision of the F-tree network and the coconut network $CT(m, n)$. Finally, we derive the explicit formulas for the subdivision of the $(n, 2)$-fire cracker and the subdivision of the coconut tree $S(CT(m, n))$.

Received: July 17, 2024
Revised: September 8, 2024
Accepted: September 30, 2024

References

P. J. Slater, Leaves of trees, Congr. Numer. 14(549-559) (1975), 37.

F. Harary and R. A. Melter, On the metric dimension of a graph, Ars. Combin. 2(191-195) (1976), 1.

Z. Beerliova, F. Eberhard, T. Erlebach, A. Hall, M. Hoffmann, M. Mihal’ak and L. S. Ram, Network discovery and verification, IEEE Journal on Selected Areas in Communications 24(12) (2006), 2168-2181.

A. Sebo and E. Tannier, On metric generators of graphs, Mathematics of Operations Research 29(2) (2004), 383-393.

A. Bogomolny and D. Greenwell, Cut the Knot: Invitation to Mastermind, 1999. http://www.maa.org/editorial/knot/Mastermind.html

S. Khuller, B. Raghavachari and A. Rosenfeld, Localization in graphs, Technical Report CS-TR3326 UMIACS, University of Maryland, 1994.

S. U. Rehman, M. Imran and I. Javaid, On the metric dimension of arithmetic graph of a composite number, Symmetry 12(4) (2020), 607.

P. Singh, S. Sharma, S. K. Sharma and V. K. Bhat, Metric dimension and edge metric dimension of windmill graphs, AIMS Mathematics 6(9) (2021), 9138-9153.

H. M. A. Siddiqui and M. Imran, Computing the metric dimension of wheel related graphs, Applied Mathematics and Computation 242 (2014), 624-632.

A. Ahmad, M. Baca and S. Sultan, Computing the metric dimension of kayak paddles graph and cycles with chord, Proyecciones (Antofagasta) 39(2) (2020), 287-300.

V. Saenpholphat and P. Zhang, Connected resolvability of graphs, Czechoslovak Mathematical Journal 53 (2003), 827-840.

L. Eroh, C. X. Kang and E. Yi, The connected metric dimension at a vertex of a graph, Theoretical Computer Science 806 (2020), 53-69.

S. Imran, M. K. Siddiqui, M. Imran, M. Hussain, H. M. Bilal, I. Z. Cheema and Z. Saleem, Computing the metric dimension of gear graphs, Symmetry 10(6) (2018), 209.

M. Dudenko and B. Oliynyk, On unicyclic graphs of metric dimension 2, Algebra Discrete Mathematics 23(2) (2017), 216-222.

G. M. Sundari and K. Murugan, Extra skolem difference mean labeling of some graphs, World Scientific News 145 (2020), 210-221.

U. Vaghela and D. Parmar, Difference perfect square cordial labeling of subdivision of snake graphs, International Journal of Future Generation Communication and Networking 13(2) (2020), 275-297.

V. Ramachandran and C. Sekar, One modulo N gracefulness of regular bamboo tree and coconut tree, International Journal on Applications of Graph Theory in Wireless Ad Hoc Networks and Sensor Networks 6(2) (2014), 1-10.

Published

2024-11-04

Issue

Section

Articles

How to Cite

ON SOME SPECIAL TREES WITH RESPECT TO THE CONNECTED METRIC DIMENSION OF GRAPHS. (2024). Advances and Applications in Discrete Mathematics, 41(8), 697-708. https://doi.org/10.17654/0974165824044

Similar Articles

1-10 of 173

You may also start an advanced similarity search for this article.

Most read articles by the same author(s)