References
- G. Chartrand and L. Lesniak, Graphs and Digraphs, Chapman and Hall, CRC, 4th edition, 2005.
- V. Saenpholphat and P. Zhang, Connected Resolvability of Graphs, Czech. Math., 53(128)(2003), 827-840. doi: 10.1023/B:CMAJ.0000024524.43125.cd
- P. J. Slater, Leaves of trees, Congr. Numer., 14(1975), 549-559.
- P. J. Slater, Domination and location in acyclic graphs, Networks, 17(1987), 55-64. doi: 10.1002/net.3230170105
- F. Harary and R. A. Melter, On the metric dimension of a graph, Ars Combin., 2(1976), 191-195.
- R. Ananthakumar and K.A. Germina, Distance Pattern Distinguishing Sets in Graphs, Adv. Stud. Contemp. Math(kyungshang) 21(Jan 2011), 107-114.
- F. Okamoto, B. Phinezy and Ping zhang, On Local Metric Dimension of a Graph, JCMCC., 72(2010), 243-259.
- W. Imrich and S. Klavzar, Product Graphs Structure and Recognition, John Wiley & Sons, Inc., Canada, 2000.
- R. Anantha Kumar and S. Arumugam, Pairwise Distance Similar Sets in Graphs, JCMCC., 84(2013), 21-28.
- R. Anantha Kumar, Local Distance Pattern Distinguishing Sets in Graphs, Trends Math. Applied Mathematics and Scientific Computing., https://doi.org/10.1007/978-3-030-01123-9_51 pp., 517-525.
- R. Anantha Kumar, Some family of distance pattern distinguishing graphs and realization results, JDMSC., 23(4)(2020), 809-823. DOI: 10.1080/09720529.2019.1624347.
- Anantha kumar. R 2013. Studies in Graph Theory - Distance Related concepts in Graphs Thesis (PhD) kalasalingam University, https://shodhganga.inflibnet.ac.in/bitstream/10603/25011/1/studies