Embedded connectivity of recursive networks

From MaRDI portal




Abstract: Let Gn be an n-dimensional recursive network. The h-embedded connectivity zetah(Gn) (resp. edge-connectivity etah(Gn)) of Gn is the minimum number of vertices (resp. edges) whose removal results in disconnected and each vertex is contained in an h-dimensional subnetwork Gh. This paper determines zetah and etah for the hypercube Qn and the star graph Sn, and eta3 for the bubble-sort network Bn.









This page was built for publication: Embedded connectivity of recursive networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329723)