The detour polynomials of ladder graphs
Joint Authors
Ali, Ali A.
Salih, Gashaw A. Muhammad
Source
al- Rafidain Journal of Computer Sciences and Mathematics
Issue
Vol. 9, Issue 1 (30 Apr. 2012), pp.139-146, 8 p.
Publisher
University of Mosul College of Computer Science and Mathematics
Publication Date
2012-04-30
Country of Publication
Iraq
No. of Pages
8
Main Subjects
Topics
Abstract AR
تعرف مسافة الالتفاف D (u, v) بين رأسين مختلفين u و v في بيان متصل G على أنها الطول لأطول درب بين u و v.
و يعرف دليل الالتفاف dd (G) على أنه ∑_({u,v})▒〖D (u,v)〗, كما تعرف متعددة حدود الالتفاف للبيان G كالآتي D (G ; x) = ∑_({u,v})▒x^(d (u,v)) . تضمن هذا البحث إيجاد متعددة حدود الالتفاف و دليل الالتفاف لأنواع من البيانات المتصلة و التي هي بشكل سلم (Ladder).
Abstract EN
The detour distance D (u, v) between two distinct vertices u and v of a connected graph G is the length of a longest u-v path inG.
The detour index dd (G) of G is defined by { , } ( , ) u v åD u v, and the detour polynomial of G is ( , ) { , } ( ; ) D u v u v D G x = å x .
The detour indices and detour polynomials of some ladder graphs are obtained in this paper.
American Psychological Association (APA)
Ali, Ali A.& Salih, Gashaw A. Muhammad. 2012. The detour polynomials of ladder graphs. al- Rafidain Journal of Computer Sciences and Mathematics،Vol. 9, no. 1, pp.139-146.
https://search.emarefa.net/detail/BIM-322015
Modern Language Association (MLA)
Ali, Ali A.& Salih, Gashaw A. Muhammad. The detour polynomials of ladder graphs. al- Rafidain Journal of Computer Sciences and Mathematics Vol. 9, no. 1 (2012), pp.139-146.
https://search.emarefa.net/detail/BIM-322015
American Medical Association (AMA)
Ali, Ali A.& Salih, Gashaw A. Muhammad. The detour polynomials of ladder graphs. al- Rafidain Journal of Computer Sciences and Mathematics. 2012. Vol. 9, no. 1, pp.139-146.
https://search.emarefa.net/detail/BIM-322015
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 146
Record ID
BIM-322015
