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 . We first establish lower and upper bounds for the number of arcs in by using the diameter and weak metric dimension of , and characterize all digraphs attaining the lower or upper bound. Then we study a digraph with weak metric dimension and classify all vertex-transitive digraphs having weak metric dimension . Finally, all digraphs of order with weak metric dimension or are determined.
Recommendations
Cites work
- Base size, metric dimension and other invariants of groups and graphs
- Commutative weakly distance-regular digraphs of girth 2.
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- Identifying codes on directed de Bruijn graphs
- Landmarks in graphs
- Mastermind
- Metric dimension of Cayley digraphs of split metacyclic groups
- On Metric Generators of Graphs
- On the dimension of oriented graphs
- On the Metric Dimension of Cartesian Products of Graphs
- On the metric dimension of directed and undirected circulant graphs
- On the metric dimension of line graphs
- Quasi-thin weakly distance-regular digraphs
- Resolvability in graphs and the metric dimension of a graph
- The directed distance dimension of oriented graphs
- The metric dimension of Cayley digraphs
- Thick weakly distance-regular digraphs
- Thin weakly distance-regular digraphs
- Weakly distance-regular digraphs
- Weakly distance-regular digraphs of valency three, II
- Weakly distance-regular digraphs of valency three. I
Cited in
(3)
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)