The Restricted Detour Polynomial of the Theta Graph
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
Mosul University
2020-05-01
|
| Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
| Subjects: | |
| Online Access: | https://csmj.mosuljournals.com/article_164664_cea9e3a4c68893fc90b825d05f8ecba7.pdf |
| _version_ | 1818526317683933184 |
|---|---|
| author | Herish Abdullah Ivan Ali |
| author_facet | Herish Abdullah Ivan Ali |
| author_sort | Herish Abdullah |
| collection | DOAJ |
| description | 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.<br /> |
| first_indexed | 2024-12-11T06:21:15Z |
| format | Article |
| id | doaj.art-914b61146e0349c287f263ec7897fb7a |
| institution | Directory Open Access Journal |
| issn | 1815-4816 2311-7990 |
| language | Arabic |
| last_indexed | 2024-12-11T06:21:15Z |
| publishDate | 2020-05-01 |
| publisher | Mosul University |
| record_format | Article |
| series | Al-Rafidain Journal of Computer Sciences and Mathematics |
| spelling | doaj.art-914b61146e0349c287f263ec7897fb7a2022-12-22T01:17:48ZaraMosul UniversityAl-Rafidain Journal of Computer Sciences and Mathematics1815-48162311-79902020-05-01141132010.33899/csmj.2020.164664164664The Restricted Detour Polynomial of the Theta GraphHerish Abdullah0Ivan Ali1Dept. of Math., College of Science University of Salahaddin/ Erbil Iraqi Kurdistan Region. IraqDept. of Math., College of Education University of Salahaddin/ Erbil Iraqi Kurdistan Region. IraqThe 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.<br />https://csmj.mosuljournals.com/article_164664_cea9e3a4c68893fc90b825d05f8ecba7.pdfrestricted detour distancerestricted detour polynomialtheta graphs |
| spellingShingle | Herish Abdullah Ivan Ali The Restricted Detour Polynomial of the Theta Graph Al-Rafidain Journal of Computer Sciences and Mathematics restricted detour distance restricted detour polynomial theta graphs |
| title | The Restricted Detour Polynomial of the Theta Graph |
| title_full | The Restricted Detour Polynomial of the Theta Graph |
| title_fullStr | The Restricted Detour Polynomial of the Theta Graph |
| title_full_unstemmed | The Restricted Detour Polynomial of the Theta Graph |
| title_short | The Restricted Detour Polynomial of the Theta Graph |
| title_sort | restricted detour polynomial of the theta graph |
| topic | restricted detour distance restricted detour polynomial theta graphs |
| url | https://csmj.mosuljournals.com/article_164664_cea9e3a4c68893fc90b825d05f8ecba7.pdf |
| work_keys_str_mv | AT herishabdullah therestricteddetourpolynomialofthethetagraph AT ivanali therestricteddetourpolynomialofthethetagraph AT herishabdullah restricteddetourpolynomialofthethetagraph AT ivanali restricteddetourpolynomialofthethetagraph |