DOI QR코드

DOI QR Code

ON CLASSES OF RATIONAL RESOLVING SETS OF POWER OF A PATH

  • JAYALAKSHMI, M. (Department of Mathematics, Dr. Ambedkar Institute of Technology) ;
  • PADMA, M.M. (Department of Mathematics, Dr. Ambedkar Institute of Technology)
  • Received : 2020.08.24
  • Accepted : 2021.07.29
  • Published : 2021.09.30

Abstract

The purpose of this paper is to optimize the number of source places required for the unique representation of the destination using the tools of graph theory. A subset S of vertices of a graph G is called a rational resolving set of G if for each pair u, v ∈ V - S, there is a vertex s ∈ S such that d(u/s) ≠ d(v/s), where d(x/s) denotes the mean of the distances from the vertex s to all those y ∈ N[x]. A rational resolving set is called minimal rational resolving set if no proper subset of it is a rational resolving set. In this paper we study varieties of minimal rational resolving sets defined on the basis of its complements and compute the minimum and maximum cardinality of such sets, respectively called as lower and upper rational metric dimensions for power of a path Pn analysing various possibilities.

Keywords

Acknowledgement

Authors are very much thankful to Dr. B. Sooryanarayana, Professor, department of Mathematics, the Principal and the Management of Dr. Ambedkar Institute of Technology, Bangalore for their constant support and encouragement during the preparation of this paper.

References

  1. G. Chartrand and G.P. Zhang, The theory and applications of resolvability in graphs:A survey, Congr. Numer. 160 (2003), 47-68.
  2. F. Harary and R.A. Meltar, On the metric dimension of a graph, Ars. Combin. 2 (1976), 191-195.
  3. F. Harary, Graph theory, Narosa Publishing House, New Delhi, 1969.
  4. G. Hartsfield and Ringel, Pearls in Graph Theory, Academic Press, USA, 1994.
  5. R.A. Melter and Tomescu, Metric bases in digital geometry, Computer Vision, Graphics, and Image Processing 25 (1984), 113-121. https://doi.org/10.1016/0734-189X(84)90051-3
  6. M.M. Padma and M. Jayalakshmi, Boundry values of rr, r*r, Rr, R*r sets of certain classes of Graphs, Journal of Applied Mathematics and Bioinformatics 6 (2016), 143-154.
  7. M.M. Padma and M. Jayalakshmi, On Classes of Rational Resolving Sets of Derived Graphs of A Path, Far East Journal of Mathematical Science 110 (2019), 247-259. https://doi.org/10.17654/ms110020247
  8. P.J. Slater, Dominating and references in a grap, J. Math. Phys. Sci. 22 (1988), 445-455.
  9. B. Sooryanarayana, On the metric dimension of graph, Indian J. Pure Appl. Math. 29 (1998), 413-415.
  10. A. Raghavendra, B. Sooryanarayana and C. Hegde, Rational metric dimension of graphs, Commun. Optim. theory 2014 (2014), 1-16.