PDF (الإنجليزية)

الكلمات المفتاحية

Restricted detour distance
restricted detour polynomial
Theta graphs

الملخص

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.  
https://doi.org/10.33899/csmj.2020.164664
  PDF (الإنجليزية)