On some resolving partitions for the lexicographic product of two graphs
From MaRDI portal
(Redirected from Publication:4976331)
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
Cites work
- k-metric antidimension: a privacy measure for social graphs
- Discrepancies between metric dimension and partition dimension of a connected graph
- Handbook of product graphs
- Landmarks in graphs
- Metric bases in digital geometry
- The partition dimension of a graph
- The partition dimension of Cayley digraphs
- The partition dimension of strong product graphs and Cartesian product graphs
Cited in
(6)- Neighbor-locating colorings in graphs
- Partition dimension of rooted product graphs
- Partition dimension of certain classes of series parallel graphs
- scientific article; zbMATH DE number 7673547 (Why is no real title available?)
- A note on the partition dimension of Cartesian product graphs
- Solution to a conjecture on resistance diameter of lexicographic product of paths
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)