- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
The Restricted Detour Polynomial of the Theta Graph | ||
| AL-Rafidain Journal of Computer Sciences and Mathematics | ||
| Article 1, Volume 14, Issue 1, 2020, Pages 13-20 PDF (632.89 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/csmj.2020.164664 | ||
| Authors | ||
| Herish O. Abdullah1; Ivan D. Ali2 | ||
| 1Dept. of Math., College of Science University of Salahaddin/ Erbil Iraqi Kurdistan Region. Iraq | ||
| 2Dept. of Math., College of Education University of Salahaddin/ Erbil Iraqi Kurdistan Region. Iraq | ||
| 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. | ||
| Keywords | ||
| Restricted detour distance; restricted detour polynomial; Theta graphs | ||
|
Statistics Article View: 478 PDF Download: 432 |
||