The connectivity of a graph is an important parameter to measure its reliability. Structure and substructure connectivity are two novel generalizations of the connectivity. In this paper, we characterize the complexity of determining structure and substructure connectivity of graphs, showing that they are both NP-complete.

翻译：图形的连通性是测量其可靠性的一个重要参数。 结构和结构下连接性是连接性的两个新颖的概括。 在本文中,我们描述了确定图形的结构和结构下连接性的复杂性,表明它们都是NP完整的。