On some resolving partitions for the lexicographic product of two graphs

DOI10.1080/00207160.2016.1190012zbMath1367.05175OpenAlexW2403641519MaRDI QIDQ4976331

Ismael González Yero, Nicolas Campanelli

Publication date: 28 July 2017

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2016.1190012

zbMATH Keywords

graphs partitioninglexicographic product graphspartition dimensionresolving partition

Mathematics Subject Classification ID

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

Related Items (3)

Partition dimension of rooted product graphs ⋮ Partition dimension of certain classes of series parallel graphs ⋮ Neighbor-locating colorings in graphs

Cites Work

• The partition dimension of strong product graphs and Cartesian product graphs
• \(k\)-metric antidimension: a privacy measure for social 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
• Metric bases in digital geometry
• Unnamed Item

This page was built for publication: On some resolving partitions for the lexicographic product of two graphs