Further new results on strong resolving partitions for graphs

DOI10.1515/MATH-2020-0142zbMATH Open1446.05027OpenAlexW3033086997MaRDI QIDQ2189231FDOQ2189231

Ismael G. Yero, Dorota Kuziak

Publication date: 15 June 2020

Published in: Open Mathematics (Search for Journal in Brave)

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

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

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)

Cites Work

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

Cited In (3)

• 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

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)