Restricted Detour Polynomial of a Straight Chain of Wheel Graphs | ||
| AL-Rafidain Journal of Computer Sciences and Mathematics | ||
| Volume 17, Issue 1, June 2023, Pages 99-106 PDF (1.02 M) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/csmj.2023.179505 | ||
| Authors | ||
| Herish Omer Abdullah* 1; Ivan Dler Ali2 | ||
| 1Salahaddin University, College of Science, Mathematics Department | ||
| 2mathematics, Education, Salahaddin University, Erbil | ||
| Abstract | ||
| Restricted detour distance between two vertices and of a graph is the length of a longest u- v path for the induced condition (V (P))=P. The restricted detour polynomial depends on restricted detour distance and is denoted by D*(G,x) and defined by D*(G,x) = ∑{u,v}xD*(u,v) where the summation is taken over all unordered pairs (u,v) of distinct vertices of u and v of V(G). In this paper, we investigate the restricted detour polynomial of the straight chain of wheel graphs φ(WkB) and compute the restricted detour index of φ(WkB). | ||
| Keywords | ||
| Restricted Detour Distance; Restricted Detour Polynomial; Straight chain; Wheel graph | ||
|
Statistics Article View: 133 PDF Download: 118 |
||