On the Geodesic Identification of Vertices in Convex Plane Graphs

Fawaz E. Alsaadi, Muhammad Salman, Masood Ur Rehman, Abdul Rauf Khan, Jinde Cao and Madini Obad Alassafi

Mathematical Problems in Engineering, 2020, vol. 2020, 1-13

Abstract:

A shortest path between two vertices and in a connected graph is a geodesic. A vertex of performs the geodesic identification for the vertices in a pair if either belongs to a geodesic or belongs to a geodesic. The minimum number of vertices performing the geodesic identification for each pair of vertices in is called the strong metric dimension of . In this paper, we solve the strong metric dimension problem for three convex plane graphs by performing the geodesic identification of their vertices.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/7483291.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/7483291.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:7483291

DOI: 10.1155/2020/7483291

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().