On the strong partition dimension of graphs

zbMath1300.05264arXiv1312.1987MaRDI QIDQ405298

Ismael González Yero

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.1987

zbMATH Keywords

strong partition dimensionstrong resolving partitionstrong metric dimensionstrong resolving graphstrong resolving set

Mathematics Subject Classification ID

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

Related Items (9)

The Edge Partition Dimension of Graphs ⋮ Uniquely identifying the edges of a graph: the edge metric dimension ⋮ Edge metric dimension and mixed metric dimension of planar graph \(Q_n\) ⋮ Further new results on strong resolving partitions for graphs ⋮ On graphs with the maximum edge metric dimension ⋮ Mixed metric dimension of graphs ⋮ On the \(k\)-partition dimension of graphs ⋮ Strong resolving partitions for strong product graphs and Cartesian product graphs ⋮ Edge metric dimensions via hierarchical product and integer linear programming

Cites Work

• Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
• A note on the partition dimension of Cartesian product graphs
• The strong metric dimension of graphs and digraphs
• Resolvability and the upper dimension of graphs
• Resolvability in graphs and the metric dimension of a graph
• On the strong metric dimension of corona product graphs and join graphs
• The partition dimension of a graph
• The partition dimension of Cayley digraphs
• Discrepancies between metric dimension and partition dimension of a connected graph
• Landmarks in graphs
• On the partition dimension of trees
• Base size, metric dimension and other invariants of groups and graphs
• Computing strong metric dimension of some special classes of graphs by genetic algorithms
• Metric bases in digital geometry
• Structure-activity maps for visualizing the graph variables arising in drug design
• Resolving domination in graphs
• Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
• On the metric dimension of Grassmann graphs
• On Metric Generators of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the strong partition dimension of graphs