On minimal edge version of doubly resolving sets of a graph

From MaRDI portal




Abstract: In this paper, we introduce the edge version of doubly resolving set of a graph which is based on the edge distances of the graph. As a main result, we computed the minimum cardinality psiE of edge version of doubly resolving sets of family of n-sunlet graph Sn and prism graph Yn.














This page was built for publication: On minimal edge version of doubly resolving sets of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6303909)