1 research outputs found
Component edge connectivity of the folded hypercube
The -component edge connectivity of a non-complete graph
is the minimum number of edges whose deletion results in a graph with at
least components. In this paper, we determine the component edge
connectivity of the folded hypercube
for and , where be a
positive integer and be the decomposition of
such that and
for .Comment: The work was included in the MS thesis of the first author in [On the
component connectiviy of hypercubes and folded hypercubes, MS Thesis at
Taiyuan University of Technology, 2017