Fig. 2.

Behaviour of the approximative search of Algorithm 1 for order $N=11$, degree $k=6$. a The effective population size $N_{\text{eff}}$ over edge removal repetitions $\ell$ for each of the 4 non-isomorphic transient amplifiers depicted in Fig. 1. The black dots mark the final values $N_{\text{eff}}>11$. b $N_{\text{eff}}$ over $\ell$ for the graph with the highest final $N_{\text{eff}}$, Fig. 1b, for all 33 sextic regular graphs which can be disturbed into this transient amplifier. c The algebraic connectivity ${\lambda }_2$ over $\ell$ for all 4 non-isomorphic transient amplifiers according to Fig. 1 and produced by taking 6-regular graphs as input. d Scatter plot of algebraic connectivity ${\lambda }_2$ and ${\mu }_2$ derived from the normalized and standard Laplacian, respectively, for different edge removal repetitions $\ell$. Black dots $\ell =0$, red dots $\ell =\{3,4\}$, green dots $\ell =\{7,8\}$, blue dots $\ell =\{11,12\}$, cyan dots $\ell =\{16,17,18\}$