Back close

Metric dimension and uncertainty of traversing robots in a network

Publication Type : Journal Article

Publisher : International Journal on Applications of Graph Theory in Wireless Ad Hoc Networks and Sensor Networks

Source : International Journal on Applications of Graph Theory in Wireless Ad Hoc Networks and Sensor Networks (GRAPH-HOC), Volume 7, p.2–3 (2015)

Url : https://d1wqtxts1xzle7.cloudfront.net/54491110/7315graph01.pdf?1505970419=&response-content-disposition=inline%3B+filename%3DMETRIC_DIMENSION_AND_UNCERTAINTY_OF_TRAV.pdf&Expires=1618830458&Signature=VeUofG6X52E9BXjNR9TW4UbCq5u2yYz1EmyzrwuYV4aqbTF8bjhM77

Keywords : Bijection, Cardinal number., Contraction, Metric dimension, Overlapping

Campus : Amritapuri

School : School of Arts and Sciences

Department : Mathematics

Year : 2015

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.

Cite this Research Publication : R. Manjusha and A Kuriakose, S., “Metric dimension and uncertainty of traversing robots in a network”, International Journal on Applications of Graph Theory in Wireless Ad Hoc Networks and Sensor Networks (GRAPH-HOC), vol. 7, pp. 2–3, 2015.

Admissions Apply Now