The strong dimension of distance-hereditary graphs
From MaRDI portal
Publication:3089290
Recommendations
- Comparing the metric and strong dimensions of graphs
- The strong metric dimension of graphs and digraphs
- On the strong metric dimension of the strong products of graphs
- On the strong metric dimension of Cartesian and direct products of graphs
- Computing a metric basis of a bipartite distance-hereditary graph
Cited in
(18)- On the strong partition dimension of graphs
- On the geodesic identification of vertices in convex plane graphs
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- Variable neighborhood search for the strong metric dimension problem
- The forcing metric dimension of a total graph of nonzero annihilating ideals
- On the strong metric dimension of Cartesian and direct products of graphs
- Strong resolving graphs: the realization and the characterization problems
- The simultaneous strong metric dimension of graph families
- The Weisfeiler-Leman dimension of distance-hereditary graphs
- The strong metric dimension of graphs and digraphs
- Closed formulae for the strong metric dimension of lexicographic product graphs
- The strong metric dimension of some generalized Petersen graphs
- Computing a metric basis of a bipartite distance-hereditary graph
- Computing a metric basis of a 2-connected bipartite distance-hereditary graph
- The threshold dimension and threshold strong dimension of a graph: a survey
- Comparing the metric and strong dimensions of graphs
- Metric dimension, minimal doubly resolving sets, and the strong metric dimension for jellyfish graph and cocktail party graph
- ON THE STRONG METRIC DIMENSION OF A TOTAL GRAPH OF NONZERO ANNIHILATING IDEALS
This page was built for publication: The strong dimension of distance-hereditary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089290)
