Further new results on strong resolving partitions for graphs

DOI10.1515/MATH-2020-0142MaRDI QIDQ2189231zbMATH OpenOpenAlexFDO

Authors Dorota Kuziak, Ismael G. Yero

Publication date 15 June 2020

Published in Open Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1515/math-2020-0142

zbMATH Keywords

strong metric dimensionstrong resolving graphstrong resolving setstrong partition dimensionstrong resolving partition

Mathematics Subject Classification ID

Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• Strong resolving partitions for strong product graphs and Cartesian product graphs
• On the strong partition dimension of graphs
• The partition dimension of strong product graphs and Cartesian product graphs
• Partition dimension and strong metric dimension of chain cycle
• The partition dimension of a graph

Cites work

• scientific article; zbMATH DE number 3878668 (Why is no real title available?)
• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• Distance-based vertex identification in graphs: the outer multiset dimension
• Landmarks in graphs
• Metric bases in digital geometry
• Mixed metric dimension of graphs
• On Metric Generators of Graphs
• On the partition dimension of a class of circulant graphs
• On the strong partition dimension of graphs
• Resolvability and the upper dimension of graphs
• Resolvability in graphs and the metric dimension of a graph
• Resolving domination in graphs
• Strong resolving graphs: the realization and the characterization problems
• Strong resolving partitions for strong product graphs and Cartesian product graphs
• Structure-activity maps for visualizing the graph variables arising in drug design
• The general position problem and strong resolving graphs
• The local metric dimension of a graph
• The metric chromatic number of a graph
• The partition dimension of a graph
• The strong metric dimension of graphs and digraphs
• Uniquely identifying the edges of a graph: the edge metric dimension
• k-metric antidimension: a privacy measure for social graphs

Cited in

(8)

• On the strong partition dimension of graphs
• Partition dimension and strong metric dimension of chain cycle
• Strong resolving partitions for strong product graphs and Cartesian product graphs
• A short note on: there is no graph \(G\) with \(G_{\mathrm{SR}} \cong\)\(K_{r, s},\ r, s \geq 2\)
• Edge metric dimensions via hierarchical product and integer linear programming
• The effect of vertex and edge deletion on the edge metric dimension of graphs
• Strong resolving graph of a zero-divisor graph
• On the strong metric dimension of some related wheel graph

This page was built for publication: Further new results on strong resolving partitions for graphs

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