17
Views
0
CrossRef citations to date
0
Altmetric
Research Article

On hendecagonal circular ladder and its metric dimension

&
Received 28 Mar 2023, Accepted 31 May 2024, Published online: 13 Jun 2024

References

  • Z. Beerliova, F. Eberhard, T. Erlebach, A. Hall, M. Hoffman, M. Mihalak, and L.S. Ram, Network discovery and verification, IEEE J. Sel. Areas Commun. 24 (2006), pp. 2168–2181.
  • G. Chartrand, L. Eroh, M.A. Johnson, and O.R. Oellermann, Resolvability in graphs and the metric dimension of a graph, Discrete Appl. Math. 105 (2000), pp. 99–113.
  • G. Chartrand, V. Saenpholphat, and P. Zhang, The independent resolving number of a graph, Math. Bohem. 128 (2003), pp. 379–393.
  • F. Harary and R.A. Melter, On the metric dimension of a graph, Ars. Comb. 2 (1976), pp. 191–195.
  • M. Imran, S.A. Bokhary, and A.Q. Baig, Families of Rotationally-Symmetric plane graphs with constant metric dimension, Southeast Asian Bull. Math. 36 (2012), pp. 663–675.
  • I. Javaid, M.T. Rahim, and K. Ali, Families of regular graphs with constant metric dimension, Util. Math. 75 (2008), pp. 21–34.
  • S. Khuller, B. Raghavachari, and A. Rosenfeld, Landmarks in graphs, Discrete Appl. Math. 70 (1996), pp. 217–229.
  • S. Lal and V.K. Bhat, On the dominant local metric dimension of some planar graphs, Discrete Math. Algorithms Appl. 15(7) (2023), pp. 2250152. DOI: 10.1142/S179383092250152X
  • K. Liu and N. Abu-Ghazaleh, Virtual coordinate back tracking for void traversal in geographic routing, in International Conference on Ad-Hoc Networks and Wireless, Springer, Berlin, Heidelberg, Vol. 4104, 2006, pp. 46–59.
  • R.A. Melter and I. Tomescu, Metric bases in digital geometry, Comput. Gr. Image Process 25 (1984), pp. 113–121.
  • M. Singh and V.K. Bhat, On metric dimension of hendecagonal circular ladder Hn, Ann. Univ. Craiova Math. Comput. Sci. Ser. 50(2) (2023), pp. 394–403.
  • S.K. Sharma and V.K. Bhat, Metric dimension of heptagonal circular ladder, Discrete Math. Algorithms Appl. 13(1) (2021), pp. 2050095. DOI: 10.1142/S1793830920500950
  • S.K. Sharma and V.K. Bhat, On metric dimension of plane graphs Jn, Kn and Ln, J. Algebra Comb. Discrete Struct. Appl. 8(3) (2021), pp. 197–212.
  • S.K. Sharma and V.K. Bhat, On some plane graphs and their metric dimension, Int. J. Appl. Comput. Math. 7(5) (2021), pp. 203. DOI: 10.1007/s40819-021-01141-z
  • S. Sharma and V.K. Bhat, Vertex resolvability of convex polytopes with n-paths of length p, Int. J. Comput. Math.: Comput. Syst. Theory 7(2) (2022), pp. 129–138.
  • S.K. Sharma and V.K. Bhat, Independence in multiresolving sets of graphs, Int. J. Comput. Math.: Comput. Syst. Theory 8(2) (2023), pp. 99–107.
  • P.J. Slater, Leaves of trees, Congr. Numer. 14 (1975), pp. 549–559.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.