Conditional resolvability in graphs: a survey
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2068163
- Resolvability in circulant graphs
- scientific article; zbMATH DE number 1998282
- scientific article; zbMATH DE number 1990687
- Completeness-resolvable graphs
- Resolvability and the upper dimension of graphs
- Connected Resolvability of Graphs
- Resolvability in graphs and the metric dimension of a graph
- Weak total resolvability in graphs
- New resolvability parameters of graphs
Cited in
(35)- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
- The metric dimension of some generalized Petersen graphs
- On the locating chromatic number of certain barbell graphs
- Solving a special case of the P conjecture using dependency graphs with dissolution
- On the strong metric dimension of corona product graphs and join graphs
- Resolving dominating partitions in graphs
- On metric dimension of plane graphs with \(\frac{m}{2}\) number of 10 sided faces
- On adjacency metric dimension of some families of graph
- A note on \(k\)-metric dimensional graphs
- The simultaneous local metric dimension of graph families
- On the metric dimension of join of a graph with empty graph(\(O_p\))
- Partition dimension of certain classes of series parallel graphs
- On the partition dimension of a class of circulant graphs
- On the strong metric dimension of tetrahedral diamond lattice
- The local metric dimension of strong product graphs
- On the partition dimension of trees
- On the locatic number of graphs
- On certain resolving parameters of tree derived architectures
- One size resolvability of graphs
- On the strong metric dimension of Cartesian and direct products of graphs
- scientific article; zbMATH DE number 2068163 (Why is no real title available?)
- Independent resolving sets in graphs
- On locating chromatic number of Möbius ladder graphs
- On randomly \(k\)-dimensional graphs
- Strong metric dimension of rooted product graphs
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
- A note on the partition dimension of Cartesian product graphs
- On the metric dimension of corona product graphs
- The adjacency dimension of some path related trees
- Conditional resolvability of honeycomb and hexagonal networks
- Maximal resolving sets in a graph
- On the independent metric dimension of some circulant graphs
- On the local metric dimension of corona product graphs
- On the locating chromatic number of Kneser graphs
- The simultaneous metric dimension of graph families
This page was built for publication: Conditional resolvability in graphs: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1777664)