On weak metric dimension of digraphs

From MaRDI portal
Publication:6132233

DOI10.1142/S1793830922500884zbMATH Open1516.05052arXiv2011.12038OpenAlexW3113079145MaRDI QIDQ6132233FDOQ6132233

Min Feng, Kaishun Wang, Yuefeng Yang

Publication date: 14 July 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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 nβˆ’1 or nβˆ’2 are determined.


Full work available at URL: https://arxiv.org/abs/2011.12038





Cites Work


Cited In (2)


   Recommendations





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)