科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let G(n) be an n-dimensional recursive network. The h-embedded connectivity zeta(h)(G(n)) (resp. edge-connectivity eta(h)(GO) 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 G(h). This paper determines zeta(h) and eta(h), for the hypercube Q(n) and the star graph S-n, and eta(3) for the bubble-sort network B-n.
