Author:
Batiha M. Iqbal,Amin Mohamed,Mohamed Basma,Jebril H. Iqbal
Abstract
Numerous applications, like robot navigation, network verification and discovery, geographical routing protocols, and combinatorial optimization, make use of the metric dimension and connected metric dimension of graphs. In this work, the connected metric dimension types of ladder graphs, namely, ladder, circular, open, and triangular ladder graphs, as well as open diagonal and slanting ladder graphs, are studied.
Reference30 articles.
1. V. Saenpholphat and P. Zhang, “Connected resolvability of graphs,” Czechoslovak Mathematical Journal, Vol. 53, No. 4, pp. 827–840, Dec. 2003, https://doi.org/10.1023/b:cmaj.0000024524.43125.cd
2. L. Eroh, C. X. Kang, and E. Yi, “The connected metric dimension at a vertex of a graph,” Theoretical Computer Science, Vol. 806, pp. 53–69, Feb. 2020, https://doi.org/10.1016/j.tcs.2018.11.002
3. P. J. Slater, “Leaves of trees,” Congressus Numerantium, Vol. 14, pp. 549–559, 1975.
4. P. J. Slater, “Dominating and reference sets in a graph,” Journal of Mathematical Physics, Vol. 22, No. 4, pp. 445–455, 1988.
5. F. Harary and R. A. Melter, “On the metric dimension of a graph,” Ars Combinatoria, Vol. 2, pp. 191–195, 1976.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献