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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
