Resolving domination in graphs

DOI10.21136/mb.2003.133935zbMath1010.05048OpenAlexW2592828425MaRDI QIDQ4802814

Gary Chartrand, Robert C. Brigham, Ping Zhang, Ronald D. Dutton

Publication date: 23 April 2003

Full work available at URL: https://eudml.org/doc/223744

zbMATH Keywords

resolving dominating setresolving domination number

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (41)

Closed formulae for the local metric dimension of corona product graphs ⋮ \(k\)-metric resolvability in graphs ⋮ Uniquely identifying the edges of a graph: the edge metric dimension ⋮ The local metric dimension of strong product graphs ⋮ On the partition dimension of trees ⋮ On adjacency metric dimension of some families of graph ⋮ The simultaneous metric dimension of families composed by lexicographic product graphs ⋮ Coloring, location and domination of corona graphs ⋮ The adjacency dimension of graphs ⋮ A note on the partition dimension of Cartesian product graphs ⋮ On the strong metric dimension of Cartesian and direct products of graphs ⋮ Movable resolving domination in graphs ⋮ On the dominant local metric dimension of some planar graphs ⋮ Further new results on strong resolving partitions for graphs ⋮ On the strong partition dimension of graphs ⋮ The dominating partition dimension and locating-chromatic number of graphs ⋮ On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results ⋮ Computing vertex resolvability of some regular planar graphs ⋮ EQUITABLE RESOLVING DOMINATING SETS IN GRAPHS ⋮ Weak total resolvability in graphs ⋮ On the strong metric dimension of corona product graphs and join graphs ⋮ On the metric dimension of corona product graphs ⋮ On the partition dimension of a class of circulant graphs ⋮ On the geodesic identification of vertices in convex plane graphs ⋮ The metric dimension of some generalized Petersen graphs ⋮ On graphs with the maximum edge metric dimension ⋮ Computing the \(k\)-metric dimension of graphs ⋮ Vertex and edge dimension of hypergraphs ⋮ Mixed metric dimension of graphs ⋮ On the dimension of trees ⋮ The Local metric dimension of the lexicographic product of graphs ⋮ Resolving dominating partitions in graphs ⋮ Simultaneous resolvability in families of corona product graphs ⋮ On the local metric dimension of corona product graphs ⋮ On the \(k\)-partition dimension of graphs ⋮ On the strong metric dimension of tetrahedral diamond lattice ⋮ The mixed metric dimension of flower snarks and wheels ⋮ Link dimension and exact construction of graphs from distance vectors ⋮ Metric dimension of fullerene graphs ⋮ On the joint product graphs with respect to dominant metric dimension ⋮ Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder

This page was built for publication: Resolving domination in graphs