Conditional resolvability in graphs: a survey

From MaRDI portal
Publication:1777664

DOI10.1155/S0161171204311403zbMath1061.05028OpenAlexW2085331602MaRDI QIDQ1777664

Varaporn Saenpholphat, Ping Zhang

Publication date: 25 May 2005

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

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



Related Items

The local metric dimension of strong product graphs, On the partition dimension of trees, On adjacency metric dimension of some families of graph, On the metric dimension of join of a graph with empty graph(\(O_p\)), A note on the partition dimension of Cartesian product graphs, On the strong metric dimension of Cartesian and direct products of graphs, Partition dimension of certain classes of series parallel graphs, Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications, The simultaneous metric dimension of graph families, On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results, On the strong metric dimension of corona product graphs and join graphs, On the metric dimension of corona product graphs, A note on \(k\)-metric dimensional graphs, On the partition dimension of a class of circulant graphs, The metric dimension of some generalized Petersen graphs, On the locating chromatic number of certain barbell graphs, Conditional resolvability of honeycomb and hexagonal networks, Strong metric dimension of rooted product graphs, On randomly \(k\)-dimensional graphs, Resolving dominating partitions in graphs, On the local metric dimension of corona product graphs, On the strong metric dimension of tetrahedral diamond lattice, On the locating chromatic number of Kneser graphs, On metric dimension of plane graphs with \(\frac{m}{2}\) number of 10 sided faces, The simultaneous local metric dimension of graph families, On the locatic number of graphs, Independent resolving sets in graphs, On locating chromatic number of Möbius ladder graphs