METRIC DIMENSION AND UNCERTAINTY OF TRAVERSING ROBOTS IN A NETWORK
Autor: | Manjusha R, Sunny Kuriakose A |
---|---|
Jazyk: | angličtina |
Rok vydání: | 2021 |
Předmět: | |
DOI: | 10.5281/zenodo.4551041 |
Popis: | 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. |
Databáze: | OpenAIRE |
Externí odkaz: |