The following pages link to Resolving domination in graphs (Q4802814):
Displayed 41 items.
- Closed formulae for the local metric dimension of corona product graphs (Q283660) (← links)
- \(k\)-metric resolvability in graphs (Q283685) (← links)
- The simultaneous metric dimension of families composed by lexicographic product graphs (Q343771) (← links)
- Coloring, location and domination of corona graphs (Q372395) (← links)
- On the strong metric dimension of Cartesian and direct products of graphs (Q400431) (← links)
- On the strong partition dimension of graphs (Q405298) (← links)
- Vertex and edge dimension of hypergraphs (Q489357) (← links)
- A note on the partition dimension of Cartesian product graphs (Q613309) (← links)
- On the metric dimension of corona product graphs (Q639103) (← links)
- Simultaneous resolvability in families of corona product graphs (Q723627) (← links)
- On the local metric dimension of corona product graphs (Q726508) (← links)
- Weak total resolvability in graphs (Q907841) (← links)
- Uniquely identifying the edges of a graph: the edge metric dimension (Q1627862) (← links)
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
- The metric dimension of some generalized Petersen graphs (Q1727099) (← links)
- On graphs with the maximum edge metric dimension (Q1730253) (← links)
- Computing the \(k\)-metric dimension of graphs (Q1735142) (← links)
- Mixed metric dimension of graphs (Q1740116) (← links)
- On the strong metric dimension of corona product graphs and join graphs (Q1949107) (← links)
- Resolving dominating partitions in graphs (Q2026342) (← links)
- The mixed metric dimension of flower snarks and wheels (Q2053650) (← links)
- Link dimension and exact construction of graphs from distance vectors (Q2065779) (← links)
- On adjacency metric dimension of some families of graph (Q2158451) (← links)
- Further new results on strong resolving partitions for graphs (Q2189231) (← links)
- On the geodesic identification of vertices in convex plane graphs (Q2217853) (← links)
- The Local metric dimension of the lexicographic product of graphs (Q2272639) (← links)
- On the \(k\)-partition dimension of graphs (Q2285123) (← links)
- On the partition dimension of a class of circulant graphs (Q2446592) (← links)
- On the strong metric dimension of tetrahedral diamond lattice (Q2516507) (← links)
- The local metric dimension of strong product graphs (Q2631070) (← links)
- On the partition dimension of trees (Q2636811) (← links)
- Metric dimension of fullerene graphs (Q5009935) (← links)
- On the joint product graphs with respect to dominant metric dimension (Q5012809) (← links)
- The adjacency dimension of graphs (Q5089704) (← links)
- Movable resolving domination in graphs (Q5101911) (← links)
- Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder (Q5866035) (← links)
- On the dimension of trees (Q5916234) (← links)
- On the dominant local metric dimension of some planar graphs (Q6059069) (← links)
- The dominating partition dimension and locating-chromatic number of graphs (Q6090326) (← links)
- Computing vertex resolvability of some regular planar graphs (Q6132231) (← links)
- EQUITABLE RESOLVING DOMINATING SETS IN GRAPHS (Q6170263) (← links)