Would you like to elaborate the uses or applications of "edge metric dimension" of a simple connected graph?

Given a simple connected undirected graph G = (V, E), for u, v ∈ V d(u, v) denotes the distance between u and v in G, i.e. the length of a shortest u−v path. A vertex x of the graph G is said to...

09 September 2018 3,195 0 View