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.
Author
(s) Details
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.
Please see the book here:- https://doi.org/10.9734/bpi/mcsru/v5/5344
No comments:
Post a Comment