On weak metric dimension of digraphs

DOI10.1142/s1793830922500884zbMath1516.05052arXiv2011.12038OpenAlexW3113079145MaRDI QIDQ6132233

Min Feng, Kaishun Wang, Yuefeng Yang

Publication date: 14 July 2023

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

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

zbMATH Keywords

digraphtwo way distanceweak metric dimensionweakly resolving set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weakly distance-regular digraphs of valency three. I
• Mastermind
• The metric dimension of Cayley digraphs
• Commutative weakly distance-regular digraphs of girth 2.
• Resolvability in graphs and the metric dimension of a graph
• Weakly distance-regular digraphs of valency three, II
• Weakly distance-regular digraphs
• Thin weakly distance-regular digraphs
• On the metric dimension of line graphs
• Thick weakly distance-regular digraphs
• On the metric dimension of directed and undirected circulant graphs
• Metric dimension of Cayley digraphs of split metacyclic groups
• Quasi-thin weakly distance-regular digraphs
• Identifying codes on directed de Bruijn graphs
• Landmarks in graphs
• The directed distance dimension of oriented graphs
• Base size, metric dimension and other invariants of groups and graphs
• On the Metric Dimension of Cartesian Products of Graphs
• On Metric Generators of Graphs