The restricted detour polynomials of a hexagonal chain and a ladder graph

Abstract

The restricted detour distance D*(u,v) between two vertices u and v of a connected graph G is the length of a longest u-v path P in G such that <V(P)>=P . The restricted detour polynomial of G, is a graph distance polynomial defined on restricted detour distance. The restricted detour polynomials and restricted detour indices of hexagonal graphs and ladder graphs are obtained in this paper.