Component edge connectivity of the folded hypercube

The $g$-component edge connectivity $clambda_g(G)$ of a non-complete graph $G$ is the minimum number of edges whose deletion results in a graph with at least $g$ components. In this paper, we determine the component edge connectivity of the folded hypercube $clambda_{g+1}(FQ_{n})=(n+1)g-(sumlimits_{i=0}^{s}t_i2^{t_i-1}+sumlimits_{i=0}^{s} icdot 2^{t_i})$ for $gleq 2^{[frac{n+1}2]}$ and $ngeq 5$, where $g$ be a positive integer and $g=sumlimits_{i=0}^{s}2^{t_i}$ be the decomposition of $g$ such that $t_0=[log_{2}{g}],$ and $t_i=[log_2({g-sumlimits_{r=0}^{i-1}2^{t_r}})]$ for $igeq 1$.