Year-end Sale % OFF 
Abstract
Networks are known to be prone to node or link failures. A central issue in the analysis of complex networks is the assessment of their robustness and vulnerability. A network is usually represented by an undirected simple graph where vertices represent processors and edges represent links between processors. Different approaches to properly define a measure for graph vulner- ability has been proposed so far. The distance d(i,j) between any two vertices i and j in a graph is the num- ber of edges in a shortest path between i and j. If there is no path connecting i and j, then d(i,j) = ∞ . Latora and Marchiori introduced the measure of effi- ciency between vertices in a graph in 2001. The unweighted efficiencybetween two vertices i and j is defined to be ij=1/dij for all i 6 j. The global efficiency of a graph Eglob = 2 n(n−1) P i6j (vi,vj) which is simply the average of the effi- ciencies over all pairs of distinct n vertices. In this paper, we study the global efficiency of special graphs. The behavior of this distance-related parameter on special graphs is taken into account by graphical analysis.
Published Version (
Free)
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: International Journal of Pure and Apllied 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.
