Detour polynomials of some cog-special graphs

Abstract

The detour distance is the length of a longest path between two distinct vertices u and υ in a connected graph G and denoted by D(u, υ), the detour distance is an important type of distances types in graph theory because of its importance in chemical applications and other sciences. We find detour polynomial, detour index and study some properties for some cog-special graphs in this paper.

Subject Classification:

• 05C30
• 82C20
• 90C35

Keywords:

• Detour distance
• Detour polynomial
• Cog-special graphs