- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
On Edge Addition Problem with some graphs | ||
| Journal of Al-Qadisiyah for Computer Science and Mathematics | ||
| Article 1, Volume 10, Issue 1, 2018, Pages 54-59 PDF (0 K) | ||
| Authors | ||
| Zainab A. H. Al-Hassan; Alaa A. Najim | ||
| Abstract | ||
| 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). | ||
| Keywords | ||
| diameter; altereded graph; edge addition problem | ||
|
Statistics Article View: 164 PDF Download: 53 |
||