References
- G. Chartrand and L. Lesniak, Graphs & Digraphs, Chapman and Hall, CRC, 4thedition, 2005.
- R. Anantha Kumar and K. A. Germina Distance Pattern Distinguishing Sets in Graphs. Adv. Stud. Contemp. Math. (Kyungshang). 21 1 2011, 107-104.
- G. Samir Khuller, Balaji Raghavachari, and Azriel Rosenfeld, Landmarks in Graphs. Discrete Appl. Math. 70 3 1996, 217-229. doi: 10.1016/0166-218X(95)00106-2
- F. Buckley and F. Harary, Distance in graphs, Addison Wesley, publishing company, Advanced Book Programme, redwood City, CA 1990.
- P.J. Slater, Leaves of trees, Congr. Numer., 14 (1975), 549-559.
- F. Harary and Melter, On metric dimensions of graphs, Ars Combin. 21976(191-195).
- H. Shapiro and S. Soderberg, A combinatory detection problem, Amer. Math. Monthly, 70(1963), 1066-1070. doi: 10.1080/00029890.1963.11992174
- G. Chartrand, L. Eroh, M. Johnson and O.R. Oellermann, Resolvability in graphs and the metric dimension of a graph, Discrete Appl. Math., 105(2000), 99–113. doi: 10.1016/S0166-218X(00)00198-0
- Z. Beerliova, F. Eberhard, T. Erlebach, A. Hall, M. Hoffman, M. Mihalak, and L. Ram, Network discovery and verification, IEEE J. on Selected Areas in Communications, 24(2006), 2168-2181. doi: 10.1109/JSAC.2006.884015
- A. SebÖ and E. Tannier, On metric generators of graphs, Math. Oper. Res., 29(2004), 383-393. doi: 10.1287/moor.1030.0070
- V. Chvátal, Mastermind, Combinatorica, 3(1983), 325-329. doi: 10.1007/BF02579188
- G. Chartrand and P. Zhang, The theory and applications of resolvability in graphs: A Survey, Congr. Numer., 160(2003), 47–68.
- J. L. Gross and Jay Yellen, Hand book of Graph Theory, CRC Press, New jersey, 2004.
- V. Saenpholphat and P. Zhang, Connected Resolvability of Graphs, Czech. Math., 53(128)(2003), 827-840. doi: 10.1023/B:CMAJ.0000024524.43125.cd
- S. Arumugam and R. Ananthakumar, Distance Similar Sets in Graphs, Util. Math., 102(2017), 265-281.
- R. Ananthakumar. Studies in Graph Theory - Distance related concepts in graphs, Dissertation thesis, Kalasalingam University, India, 2013.