The restricted detour polynomial of the theta graph
Other Title(s)
متعددة حدود الألتفاف المقيدة للبيان ثيتا
Joint Authors
Ali, Ivan Dilir
Abd Allah, Hirish O.
Source
al- Rafidain Journal of Computer Sciences and Mathematics
Issue
Vol. 14, Issue 1 (30 Jun. 2020), pp.13-20, 8 p.
Publisher
University of Mosul College of Computer Science and Mathematics
Publication Date
2020-06-30
Country of Publication
Iraq
No. of Pages
8
Main Subjects
Topics
Abstract AR
تعرف مسافة الألتفاف المقيدة D^* (u,v) لرأسين u و v في البيان المتصل G على أنها الطول لأطول درب P في G بين الرأسين u و v و الذي يحقق ألشرط 〈V(P)〉=P.
أن الهدف الرئيسي لهذا البحث هو أيجاد متعددة حدود الألتفاف المقيد للبيان ثيتا، و كذلك تم الحصول على دليل الألتفاف المقيدة للبيان ثيتا.
Abstract EN
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.
American Psychological Association (APA)
Abd Allah, Hirish O.& Ali, Ivan Dilir. 2020. The restricted detour polynomial of the theta graph. al- Rafidain Journal of Computer Sciences and Mathematics،Vol. 14, no. 1, pp.13-20.
https://search.emarefa.net/detail/BIM-1224847
Modern Language Association (MLA)
Abd Allah, Hirish O.& Ali, Ivan Dilir. The restricted detour polynomial of the theta graph. al- Rafidain Journal of Computer Sciences and Mathematics Vol. 14, no. 1 (2020), pp.13-20.
https://search.emarefa.net/detail/BIM-1224847
American Medical Association (AMA)
Abd Allah, Hirish O.& Ali, Ivan Dilir. The restricted detour polynomial of the theta graph. al- Rafidain Journal of Computer Sciences and Mathematics. 2020. Vol. 14, no. 1, pp.13-20.
https://search.emarefa.net/detail/BIM-1224847
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 20-21
Record ID
BIM-1224847
