A Note on Square Free Detour Distance in Graphs

Abstract

In this paper, we investigate the results on square free detour number of a simple, connected graph of order  It is proved that for any two vertices u and v in a connected graph G, 0 ? ? ? ? n – 1. The relationship between radious and diameter of various distance concepts is discussed. It is also shown that for each pair a, b of positive integers with 3 ? a ? b, there exists a connected graph G with = a and  = b.