Minimum edge cuts of hypercubes and k-ary n-cubes leaving every fault-free node in given subnetworks
Yuxing Yang,
Kaiyue Meng
Abstract:The hypercube and the $k$-ary $n$-cube are two leading interconnection networks for multiprocessor systems. {\it A $t$-embedded edge cut} of an $n$-dimensional recursive interconnection network $G_n$ is a set of edges whose removal separates $G_n$ and each vertex lies in a $t$-dimensional subnetwork of the residual network. The network $G_n$ is {\it super $t$-embedded edge connected} ({\it super-$\eta_t$} for short) if the deletion of an arbitrary minimum $t$-embedded edge cut of $G_n$ isolates a $t$-dimension… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.