“…Since the maximum attainable node degree d M = max i∈{1,...,n} |N i (t)| in G α over time is d M = 3, one has Ψ Gα = d M α = 3α and, according to (28), inequality Ψ Gα < (t) −1 can be reduced to Ψ Gα < −1 , yielding the design constraint α ∈ (0, 1/3) ⊂ Q α . Assuming, once again, that edge (3,4) is subject to an attack δ θ 34 , parameter α can be selected to maximize the r.h.s. of guarantee (33), by imposing 1 − 3α = 4α/3 and obtaining α = 3/13 ∈ (0, 1/3).…”