python code to draw the graph which represent the relation between node of links connectivity and algebraic connectivity using networx package .the result should be similar to this figure.also i put the algorithm .

0,996,643 papers from all fields of science random graph 10 T 9 N = 50 N = 500 N = 1000 8. 7 algebraic connectivity 3 2 0 2 3 8 9 10 4 5 6 7 node and link connectivity Fig. 2. The mean as well as the standard deviation (error bars) of the algebraic connectivity uN-1 as a function of the node connectivity KN and the link connectivity KN in the random graph of Erds-Rnyi with N = 50, 500 and 1000 nodes. 100 90 80 701 (%) 60 50 401 Ebone Exodus Aboven 10 20 30 40 50 1989 70 80 90 90 Fig. 1. n parameter as function of threshold Yth 7: Algorithm 1 ESACON 1: Input: a network graph G(N,E); 2: /* STEP 1 */ 3: E = ; 4: \" is the algebraic connectivity of graph G; 5: L = zeros; 6: for each l E E do L[1] = 1: 8: 11 = 12(G') where G' = (N, E 1); 9: A = 15" - th; 10: end for 11: C = sort I in increasing order based on the values A'; /*Output of STEP 1*/ 12: /* STEP 2 */ 13: S = 0; 14: for i = 1, 2, ..., E do Afin = 12(G') where G' = (N, E - S - C[i]); 7 = (1, in as) * 100; 17: if 'th then switch off L[i]; S=S U C[i]; 20: end if 21: end for 22: Outputs: S /*list of network's links that are switched off*/ and Gf in = (N, E - S) /*final network topology*/. 15: 16: 18: 19