On 2-extra edge connectivity of folded crossed cube

The g-extra edge connectivity is an important parameter in measuring the reliability and fault tolerance of large interconnection networks. Let G be a connected graph and an integer g≥0, the g-extra edge connectivity of G, denoted by λg(G), is the minimum cardinality of a set of edges of G, if it exists, whose deletion disconnects G and leaves each remaining component to have at least g+1 vertices.