Abstract
The restricted detour index of a connected graph G is equal to the sum of restricted detour distances of all unordered pairs of vertices of G. The restricted detour polynomial of graph G is defined as , where C*(G, k) is the number of unordered pairs of vertices of G laying at restricted detour distance k from each other and δ * is restricted detour diameter of G. In this paper, restricted detour polynomials and restricted detour indices of prism graphs, helm graphs and closed helm graphs have been computed.
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.
