A Study on the Strong Metric Dimension Problem for Certain Tree-Derived Networks

Authors

  • Prathab H P.G & Research Department of Mathematics, Pachaiyappa’s College, Chennai 600030, India and Department of Mathematics, Saveetha Engineering College, Chennai, India.
  • Chandrasekarn S P.G & Research Department of Mathematics, Pachaiyappa’s College, Chennai 600030, India.
  • Sathish K Department of Mathematics and Statistics, Faculty of Science and Humanities, SRM Institute of Science and Technology, Kattankulathur, Chengalpattu, India.

DOI:

https://doi.org/10.9734/bpi/mcsru/v5/5344

Keywords:

Metric dimension, certain tree-derived networks, Harary, Melter independently

Abstract

The concept of metric dimension is a well-known graph invariant with numerous practical applications, particularly in areas such as network navigation, robot navigation, chemistry, and image processing. One of its notable uses is in designing efficient navigation systems within transportation and communication networks, where uniquely identifying every location through minimal reference points is critical. The strong metric dimension is another invariant that is more restricted than the metric dimension. This study examines the strong metric dimension problem in a class of tree-derived networks.

Downloads

Published

2025-05-23

How to Cite

Prathab H, Chandrasekarn S, & Sathish K. (2025). A Study on the Strong Metric Dimension Problem for Certain Tree-Derived Networks. Mathematics and Computer Science: Research Updates Vol. 5, 95–102. https://doi.org/10.9734/bpi/mcsru/v5/5344

Issue

Mathematics and Computer Science: Research Updates Vol. 5

Section

Chapters