The metric dimension of unicyclic graphs

By C. Poisson, Ping Zhang. 2002

91 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

The metric dimension of regular bipartite graphs (2011, background): “However, some results for certain class of graphs have been obtained, such as cycles [4], trees [3, 7, 10], fans [2], wheels [1, 2, 16], complete n-partite graphs [3, 15], unicylic graphs [13], grids [12], honeycomb networks [11], circulant networks [14], Cayley graphs [5], graphs with pendants [9],”
On the Metric Dimension of Cartesian Products of Graphs (2005, background): “Resolving sets have since been widely investigated [4, 8, 9, 10, 11, 12, 14, 17, 18, 27, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 48] and arise in many diverse areas, including network discovery and verification [2], robot navigation [27, 41], connected joins in graphs [40], and strategies for th”