Let G =（V, E） be a connected graph and m be a positive integer, the conditional edge connectivity λ;is the minimum cardinality of a set of edges,if it exists, whose deletion disconnects G and leaves each remaining ...Let G =（V, E） be a connected graph and m be a positive integer, the conditional edge connectivity λ;is the minimum cardinality of a set of edges,if it exists, whose deletion disconnects G and leaves each remaining component with minimum degree δ no less than m. This study shows that λ;(Q;) = 2 n,λ;(Q;) = 4 n-4（2 ≤ k ≤ n-1, n ≥ 3） for n-dimensional enhanced hypercube Q;. Meanwhile, another easy proof about λ;（Q;） = 4 n-8, for n ≥ 3 is proposed. The results of enhanced hypercube include the cases of folded hypercube.展开更多
文摘Let G =（V, E） be a connected graph and m be a positive integer, the conditional edge connectivity λ;is the minimum cardinality of a set of edges,if it exists, whose deletion disconnects G and leaves each remaining component with minimum degree δ no less than m. This study shows that λ;(Q;) = 2 n,λ;(Q;) = 4 n-4（2 ≤ k ≤ n-1, n ≥ 3） for n-dimensional enhanced hypercube Q;. Meanwhile, another easy proof about λ;（Q;） = 4 n-8, for n ≥ 3 is proposed. The results of enhanced hypercube include the cases of folded hypercube.
