Weak total resolvability in graphs

DOI10.7151/dmgt.1853zbMath1329.05092OpenAlexW2567688117WikidataQ57974221 ScholiaQ57974221MaRDI QIDQ907841

Henning Fernau, Katrin Casel, Alejandro Estrada-Moreno, Juan Alberto Rodríguez-Velázquez

Publication date: 26 January 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1853

zbMATH Keywords

resolving setmetric dimensiongraph operationsadjacency dimensionweak total metric dimensionweak total resolving set

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

On the \(k\)-partition dimension of graphs

Cites Work

• Resolving domination in graphs
• The independent resolving number of a graph
• On Metric Generators of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weak total resolvability in graphs