On edge addition problem with some graphs
Joint Authors
al-Hasan, Zaynab Abd al-Amir Hamzah
Najm, Ala Amir
Source
al-Qadisiyah Journal for Computer Science and Mathematics
Issue
Vol. 10, Issue 1 (30 Jun. 2018), pp.54-59, 6 p.
Publisher
University of al-Qadisiyah College of computer Science and Information Technology
Publication Date
2018-06-30
Country of Publication
Iraq
No. of Pages
6
Main Subjects
Abstract EN
The two questions that: how many edges at least have to be added to the network to ensure the message d within the effective bounds, and how large message delay will be increased when faults occur, can re-write this problem as: What the minimum diameter of a connected graph obtained from a graph of diameter d after adding t extra edges, this problem called “Edge Addition Problem”.
In this paper we find some exact values to above problem by using some special graphs (Line Graph, Bipartite graph, and complete Bipartite graph).
American Psychological Association (APA)
Najm, Ala Amir& al-Hasan, Zaynab Abd al-Amir Hamzah. 2018. On edge addition problem with some graphs. al-Qadisiyah Journal for Computer Science and Mathematics،Vol. 10, no. 1, pp.54-59.
https://search.emarefa.net/detail/BIM-833831
Modern Language Association (MLA)
Najm, Ala Amir& al-Hasan, Zaynab Abd al-Amir Hamzah. On edge addition problem with some graphs. al-Qadisiyah Journal for Computer Science and Mathematics Vol. 10, no. 1 (2018), pp.54-59.
https://search.emarefa.net/detail/BIM-833831
American Medical Association (AMA)
Najm, Ala Amir& al-Hasan, Zaynab Abd al-Amir Hamzah. On edge addition problem with some graphs. al-Qadisiyah Journal for Computer Science and Mathematics. 2018. Vol. 10, no. 1, pp.54-59.
https://search.emarefa.net/detail/BIM-833831
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 51-52
Record ID
BIM-833831
