On the robustness of interconnections in random graphs: a symbolic approach