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 · 30.09.2015 · 7 (2/3) · 1-9
DOI: 10.5121/jgraphoc.2015.7301 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks, online erschienen am 30.09.2015. Verfasst von Manjusha R und 1 weiteren Autor:innen. Die Arbeit wurde bisher 11-mal zitiert (Crossref).
Abstract (Originalsprache)
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.
Zitieren
APA
R, M., & A, S. K. (2015). 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, 7(2/3), 1-9. https://doi.org/10.5121/jgraphoc.2015.7301
Vancouver
R M, A SK. 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. 2015;7(2/3):1-9. doi:10.5121/jgraphoc.2015.7301
BibTeX
@article{R2015,
author = {R, Manjusha and A, Sunny Kuriakose},
title = {Metric Dimension and Uncertainty of Traversing Robots in a Network},
journal = {International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks},
year = {2015},
volume = {7},
number = {2/3},
pages = {1--9},
doi = {10.5121/jgraphoc.2015.7301}
}
EUVIMED