We develop a 3D bounded slice-surface grid （3D-BSSG） structure for representation and introduce the solution space smoothing technique to search for the optimal solution. Experiment results demonstrate that a 3D-BSS...We develop a 3D bounded slice-surface grid （3D-BSSG） structure for representation and introduce the solution space smoothing technique to search for the optimal solution. Experiment results demonstrate that a 3D-BSSG structure based algorithm is very effective and efficient.展开更多
Given a graph G and a non-negative integer h, the h-restricted connectivity κh（G） of G is the minimum cardinality of a set of vertices of G, in which at least h neighbors of any vertex is not included, if any, whos...Given a graph G and a non-negative integer h, the h-restricted connectivity κh（G） of G is the minimum cardinality of a set of vertices of G, in which at least h neighbors of any vertex is not included, if any, whose deletion disconnects G and every remaining component has the minimum degree of vertex at least h; and the h-extra connectivity κh（G） of G is the minimum cardinality of a set of vertices of G, if any, whose deletion disconnects G and every remaining component has order more than h. This paper shows that for the hypercube Qn and the folded hypercube FQn, κ1（Qn）=κ（1）（Qn）=2n-2 for n≥3, κ2（Qn）=3n-5 for n≥4, κ1（FQn）=κ（1）（FQn）=2n for n≥4 and κ（2）（FQn）=4n-4 for n≥8.展开更多
文摘We develop a 3D bounded slice-surface grid （3D-BSSG） structure for representation and introduce the solution space smoothing technique to search for the optimal solution. Experiment results demonstrate that a 3D-BSSG structure based algorithm is very effective and efficient.
文摘Given a graph G and a non-negative integer h, the h-restricted connectivity κh（G） of G is the minimum cardinality of a set of vertices of G, in which at least h neighbors of any vertex is not included, if any, whose deletion disconnects G and every remaining component has the minimum degree of vertex at least h; and the h-extra connectivity κh（G） of G is the minimum cardinality of a set of vertices of G, if any, whose deletion disconnects G and every remaining component has order more than h. This paper shows that for the hypercube Qn and the folded hypercube FQn, κ1（Qn）=κ（1）（Qn）=2n-2 for n≥3, κ2（Qn）=3n-5 for n≥4, κ1（FQn）=κ（1）（FQn）=2n for n≥4 and κ（2）（FQn）=4n-4 for n≥8.
