Abstract

Metric dimension in graph theory has many applications in the real world. It has been applied to the optimization problems in complex networks, analyzing electrical networks; show the business relations, robotics, control of production processes etc. This paper studies the metric dimension of graphs with respect to contraction and its bijection between them. Also an algorithm to avoid the overlapping between the robots in a network is introduced.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.