Xiujun Zhang1, Muhammad Salman2, Anam Rani3, Rashna Tanveer2, Usman Ali3,*, Zehui Shao4
CMES-Computer Modeling in Engineering & Sciences, Vol.136, No.1, pp. 883-899, 2023, DOI:10.32604/cmes.2023.025162
Abstract The distance between two vertices u and v in a connected graph G is the number of edges lying in a shortest path
(geodesic) between them. A vertex x of G performs the metric identification for a pair (u, v) of vertices in G if
and only if the equality between the distances of u and v with x implies that u = v (That is, the distance between
u and x is different from the distance between v and x). The minimum number of vertices performing the metric
identification for every pair of vertices in G defines the metric… More >
Login
Register
