The metric dimensions of a complete n-partite graph and its Cartesian product with a path
From MaRDI portal
(Redirected from The metric dimensions of a complete n-partite graph and its Cartesian product with a path)
The metric dimensions of a complete \(n\)-partite graph and its Cartesian product with a path
The metric dimensions of a complete \(n\)-partite graph and its Cartesian product with a path
Recommendations
Cited in
(22)- Maker-breaker resolving game
- Completeness-resolvable graphs
- Truncated metric dimension for finite graphs
- The connected metric dimension at a vertex of a graph
- On the metric dimension of join of a graph with empty graph(\(O_p\))
- On the metric dimension of Cartesian powers of a graph
- On the metric dimension of circulant and Harary graphs
- The metric dimension of regular bipartite graphs
- Bounds on the sum of domination number and metric dimension of graphs
- On metric dimension of permutation graphs
- The metric dimension of comb product graphs
- Solis Graphs and Uniquely Metric Basis Graphs
- scientific article; zbMATH DE number 7560302 (Why is no real title available?)
- The non-isolated resolving number of a graph Cartesian product with a complete graph
- scientific article; zbMATH DE number 7589564 (Why is no real title available?)
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
- On the metric dimension of bipartite graphs
- A study on avoiding RFI in the movement of robots via radio resolving number problem
- On distance-s locating and distance-t dominating sets in graphs
- Runner locating with multiple probes
- On examining metric dimension through edge contraction in certain families of graphs
- Throttling for metric dimension and its variants
This page was built for publication: The metric dimensions of a complete \(n\)-partite graph and its Cartesian product with a path
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565930)
