On restricted connectivity and extra connectivity of hypercubes and folded hypercubes (Q2574474): Difference between revisions

The \(h\)-extra connectivity of a graph \(G\) is the minimum cardinality of a set of vertices of \(G\) whose deletion disconnects \(G\) and every remaining component has order more than \(h\). The \(h\)-restricted connectivity of \(G\) is the minimum cardinality of a set of vertices of \(G\) in which at least \(h\) neighbors of any vertex are not included, whose deletion disconnects \(G\) and every remaining component has the minimum degree of vertex at least \(h\). The authors establish the \(h\)-extra connectivity and \(h\)-restricted connectivity of hypercubes and folded hypercubes for \(h = 1\) and 2.