Detour Polynomials of Some Certain Graphs

Abstract

The length of a longest u–v path in a connected graph  between two distinct vertices u and v is called detour distance and denoted by , the detour distance is an important type of distances types in graph theory because of its importance in chemical applications and other sciences. In this paper, we find detour polynomials, detour index and study some properties for some certain graphs such as: Wagner graph, friendship graph, double cycles and double paths graphs.