Abstract
Let Gn be an n-dimensional recursive network. The h-embedded connectivity ζh(Gn) (resp. edge-connectivity ηh(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 ζh and ηh for the hypercube Qn and the star graph Sn, and η3 for the bubble-sort network Bn.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
