The Restricted Detour Polynomial of the Theta Graph

Section: Research Paper
Issue
Vol. 14 No. 1 (2020): Volume 14 Issue 1
Published
Jun 3, 2020
Pages
13-20

Abstract

The restricted detour distance D*(u,v) between two vertices u and v of a connected graph G is the length of a longest u - v path P in G such that <V(P)> = P. The main goal of this paper is to obtain the restricted detour polynomial of the theta graph. Moreover, the restricted detour index of the theta graph will also be obtained.

Authors

Herish O. Abdullah

Dept. of Math., College of Science University of Salahaddin/ Erbil Iraqi Kurdistan Region. Iraq

Ivan D. Ali

Dept. of Math., College of Education University of Salahaddin/ Erbil Iraqi Kurdistan Region. Iraq

Identifiers

https://doi.org/10.33899/csmj.2020.164664%20
Download this PDF file
PDF

Statistics

How to Cite

O. Abdullah, H., & D. Ali, I. (2020). The Restricted Detour Polynomial of the Theta Graph. AL-Rafidain Journal of Computer Sciences and Mathematics, 14(1), 13–20. https://doi.org/10.33899/csmj.2020.164664
Copyright and Licensing
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.