Year-end Sale % OFF 
Abstract
The two questions that: how many edges at least have to be added to the network to ensure the message 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 after adding 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).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Al-Qadisiyah for Computer Science and Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
