Weakly connected resolving sets in graphs

DOI10.1142/S1793830923501185MaRDI QIDQ6983327zbMATH OpenFDO

Authors J. Sivakumar, A. Wilson Baskar, R. Sundareswaran, Swaminathan Venkatasubramanian

Publication date 15 May 2025

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

Full work available at URL https://doi.org/10.1142/S1793830923501185

zbMATH Keywords

metric dimensionresolving setsweakly connected resolving sets

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cites work

• A textbook of graph theory
• Connected Resolvability of Graphs
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• scientific article; zbMATH DE number 1749658 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• On the metric dimension of infinite graphs
• On the metric dimension, the upper dimension and the resolving number of graphs
• Resolvability in graphs and the metric dimension of a graph
• Resolving domination in graphs
• The partition dimension of a graph

This page was built for publication: Weakly connected resolving sets in graphs

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