Abstract
The rational distance from the vertex u to the vertex v in a graph G, denoted by d(v/u), is defined as the average distances from the vertex u to the closed neighbors of v if u 6= v, else it is 0. A subset S of vertices of G is called rational resolving set of G if for every pair u, v of distinct vertices in V−S, there is a w ∈ S such that d(u/w) ≠ d(v/w) in G. In this paper powerful and maximal rational resolving sets are introduced and minimum cardinality of such sets are computed for the wheel graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
