On weak metric dimension of digraphs

From MaRDI portal



Abstract: Using the two way distance, we introduce the concepts of weak metric dimension of a strongly connected digraph Gamma. We first establish lower and upper bounds for the number of arcs in Gamma by using the diameter and weak metric dimension of Gamma, and characterize all digraphs attaining the lower or upper bound. Then we study a digraph with weak metric dimension 1 and classify all vertex-transitive digraphs having weak metric dimension 1. Finally, all digraphs of order n with weak metric dimension n1 or n2 are determined.











This page was built for publication: On weak metric dimension of digraphs

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