The restricted detour polynomial of the theta graph

الملخص EN

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 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.