The Restricted Detour Polynomial of the Theta 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 = P. The main goal of this paper is to obtain the restricted detour polynomial of the theta graph. Moreover, the restricted detour index of the theta graph will also be obtained.

Keywords

• restricted detour distance
• restricted detour polynomial
• theta graphs