On the partition dimension of trees

DOI10.1016/j.dam.2013.09.026zbMath1283.05225arXiv1110.5289WikidataQ57974281 ScholiaQ57974281MaRDI QIDQ2636811

Ismael González Yero, Magdalena Lemańska, Juan Alberto Rodríguez-Velázquez

Publication date: 18 February 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

partition dimension; resolving partition; resolving sets

Mathematics Subject Classification ID

05C05: Trees

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

The partition dimension of a subdivision of a homogeneous firecracker, On the bounded partition dimension of some classes of convex polytopes, On the strong partition dimension of graphs, On the partition dimension of two-component graphs, Resolving dominating partitions in graphs, On the \(k\)-partition dimension of graphs, Neighbor-locating colorings in graphs, Partition dimension of rooted product graphs, Partition dimension of certain classes of series parallel graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the partition dimension of Cartesian product graphs
• Resolvability and the upper dimension of graphs
• Resolvability in graphs and the metric dimension of a graph
• Conditional resolvability in graphs: a survey
• The partition dimension of a graph
• The partition dimension of Cayley digraphs
• Locating and total dominating sets in trees
• Discrepancies between metric dimension and partition dimension of a connected graph
• Landmarks in graphs
• On the metric dimension of some families of graphs
• Metric bases in digital geometry
• Structure-activity maps for visualizing the graph variables arising in drug design
• Resolving domination in graphs