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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call