In this work, we propose a methodology to quantify robustness in networks. Specifically, the methodology is based on the resolution of the Vertex Separator Problem in order to find the set of nodes that the elimination of their links causes the rupture of the giant component. The methodology presented in this work was tested on a set of benchmark networks and on set of social networks modeled with the information about the main characteristics of the universities belonging to the Higher Education System in Mexico (HESM) for the period 2013–2017. The results show that the proposed methodology is able to quantify the robustness in several types of networks without using centrality measures or some other structural metric. On the other hand, regarding the HESM networks, we can assure that they are robust and that they are prone to generate communities or modules.

在这项工作中，我们提出了一种量化网络鲁棒性的方法。具体而言，该方法基于“顶点分离器问题”的解决方案，以便找到节点集，这些节点的链接消除会导致巨型组件破裂。这项工作中介绍的方法论在一组基准网络和一组社交网络上进行了测试，这些网络以关于墨西哥高等教育体系（HESM）2013-2017年期间大学主要特征的信息为模型。结果表明，所提出的方法能够在不使用集中度度量或其他结构度量的情况下，量化几种类型网络的鲁棒性。另一方面，关于HESM网络，