Contractibility of bipartite graphs
Other Title(s)
قابلية انكماش البيانات ثنائية التجزئة
Author
Source
Issue
Vol. 3, Issue 3 (31 Dec. 2007), pp.1-10, 10 p.
Publisher
University of Thi-Qar Research and Development Department
Publication Date
2007-12-31
Country of Publication
Iraq
No. of Pages
10
Main Subjects
Abstract AR
في هذا البحث أثبتنا بأن البيانات ثنائية التجزئة هي بيانات غير قابلة للانكماش ثم ميزنا البيانات ثنائية التجزئة التي لها عدد انكماش أقل أو يساوي اثنان.
Abstract EN
Akram[2006] introduced the concept of contractible class.
He proved that the classes of Hamiltonian and 3-connected graphs as well as the class of trees are contractible classes.
Further he introduced the concept of contractibility number and characterized regular graphs having contractibility number less equal two.
In this work we characterized bipartite graphs having contractibility number less equal two.
American Psychological Association (APA)
Attar, Akram Barzan. 2007. Contractibility of bipartite graphs. University of Thi-Qar Journal،Vol. 3, no. 3, pp.1-10.
https://search.emarefa.net/detail/BIM-276856
Modern Language Association (MLA)
Attar, Akram Barzan. Contractibility of bipartite graphs. University of Thi-Qar Journal Vol. 3, no. 3 (Dec. 2007), pp.1-10.
https://search.emarefa.net/detail/BIM-276856
American Medical Association (AMA)
Attar, Akram Barzan. Contractibility of bipartite graphs. University of Thi-Qar Journal. 2007. Vol. 3, no. 3, pp.1-10.
https://search.emarefa.net/detail/BIM-276856
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 10
Record ID
BIM-276856
