Tournaments (-1)-chain and connexity
Author
Source
Journal of University of Babylon for Humanities
Issue
Vol. 14, Issue 3 (30 Sep. 2007), pp.37-39, 3 p.
Publisher
Publication Date
2007-09-30
Country of Publication
Iraq
No. of Pages
3
Main Subjects
Abstract AR
يتناول البحث دراسة في الاتصال لـ (-1) لعلاقة السلسلة الدورية و علاقة الدورة ذات الطول 3 الموجودة في العلاقة أعلاه.
ثم برهنا بأن (-1) علاقة السلسلة الدورية هي (-1) علاقة قابلة لإعادة بناءها.
Abstract EN
In this paper, we study the connexity in the (-1) chain tournament, also the cycle of length 3 contained in these tournaments, and we prove that the (-1) chain is (-1) reconstructible.
American Psychological Association (APA)
Abd al-Jalil, Nihad. 2007. Tournaments (-1)-chain and connexity. Journal of University of Babylon for Humanities،Vol. 14, no. 3, pp.37-39.
https://search.emarefa.net/detail/BIM-339316
Modern Language Association (MLA)
Abd al-Jalil, Nihad. Tournaments (-1)-chain and connexity. Journal of University of Babylon for Humanities Vol. 14, no. 3 (2007), pp.37-39.
https://search.emarefa.net/detail/BIM-339316
American Medical Association (AMA)
Abd al-Jalil, Nihad. Tournaments (-1)-chain and connexity. Journal of University of Babylon for Humanities. 2007. Vol. 14, no. 3, pp.37-39.
https://search.emarefa.net/detail/BIM-339316
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 39
Record ID
BIM-339316
