Resolving domination in graphs

DOI10.21136/MB.2003.133935MaRDI QIDQ4802814zbMATH OpenOpenAlexFDO

Authors Robert Brigham, Gary Chartrand, 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

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

Recommendations

• Resolving domination number of graphs
• scientific article; zbMATH DE number 2068163
• scientific article; zbMATH DE number 2197925
• Connected Resolvability of Graphs
• Characterization of \(n\)-vertex graphs with metric dimension \({n-3}\).

Cited in

(46)

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

This page was built for publication: Resolving domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4802814)