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 |