Weak total resolvability in graphs

DOI10.7151/DMGT.1853MaRDI QIDQ907841zbMATH OpenOpenAlexWikidataFDO

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

Publication date 26 January 2016

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

metric dimensionresolving setgraph operationsadjacency dimensionweak total metric dimensionweak total resolving set

Mathematics Subject Classification ID

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

Recommendations

• Weak total resolving sets in graphs
• New resolvability parameters of graphs
• scientific article; zbMATH DE number 6542389
• The metric dimension of Cartesian products of graphs

Cites work

• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Handbook of product graphs
• On Metric Generators of Graphs
• Resolving domination in graphs
• The independent resolving number of a graph
• The local metric dimension of a graph

Cited in

(6)

• On the k-partition dimension of graphs
• Resolving vertices of graphs with differences
• Weak total resolving sets in graphs
• Conditional resolvability in graphs: a survey
• On weak resolutions
• Weak near-unanimity functions and digraph homomorphism problems

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

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