On some resolving partitions for the lexicographic product of two graphs

DOI10.1080/00207160.2016.1190012zbMATH Open1367.05175OpenAlexW2403641519MaRDI QIDQ4976331FDOQ4976331

Ismael G. Yero, N. 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

Recommendations

• A note on the partition dimension of Cartesian product graphs
• The partition dimension of strong product graphs and Cartesian product graphs
• The metric dimension of the lexicographic product of graphs
• The partition dimension of the corona product of two graphs
• Connected partition dimensions of graphs

zbMATH Keywords

lexicographic product graphsgraphs partitioningpartition dimensionresolving partition

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Landmarks in graphs
• Metric bases in digital geometry
• The partition dimension of a graph
• The partition dimension of Cayley digraphs
• Discrepancies between metric dimension and partition dimension of a connected graph
• The partition dimension of strong product graphs and Cartesian product graphs
• \(k\)-metric antidimension: a privacy measure for social graphs

Cited In (5)

• Title not available (Why is that?)
• Solution to a conjecture on resistance diameter of lexicographic product of paths
• Partition dimension of rooted product graphs
• Neighbor-locating colorings in graphs
• Partition dimension of certain classes of series parallel graphs

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

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