The independent resolving number of a graph
From MaRDI portal
Publication:4828807
DOI10.21136/mb.2003.134003zbMath1050.05043OpenAlexW2255753884MaRDI QIDQ4828807
Gary Chartrand, Varaporn Saenpholphat, Ping Zhang
Publication date: 26 November 2004
Full work available at URL: https://eudml.org/doc/224041
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Closed formulae for the local metric dimension of corona product graphs, Uniquely identifying the edges of a graph: the edge metric dimension, The local metric dimension of strong product graphs, On adjacency metric dimension of some families of graph, The simultaneous metric dimension of families composed by lexicographic product graphs, The adjacency dimension 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, Fault-tolerant resolvability of some graphs of convex polytopes, The fault‐tolerant beacon set of hexagonal Möbius ladder network, Weak total resolvability in graphs, On the strong metric dimension of corona product graphs and join graphs, On the geodesic identification of vertices in convex plane graphs, The metric dimension of some generalized Petersen graphs, Computing the \(k\)-metric dimension of graphs, Mixed metric dimension of graphs, The \(k\)-size edge metric dimension of graphs, The vertex-edge resolvability of some wheel-related graphs, On unretractive graphs, The Local metric dimension of the lexicographic product of graphs, On the local metric dimension of corona product graphs, The locating number of hexagonal Möbius ladder network, Link dimension and exact construction of graphs from distance vectors, On metric dimension of plane graphs with \(\frac{m}{2}\) number of 10 sided faces, Independent resolving sets in graphs, Computing the metric dimension for chain graphs
