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.
Subject Classification: