Abstract
A network is always viewed as a simple connected graph. The connectivity of a network can evaluate its fault tolerance and reliability. Since the faulty elements of a graph may have special structures, the (strong) structure connectivity and (strong) substructure connectivity were proposed as generalizations of connectivity. We give the (strong) structure connectivity and (strong) substructure connectivity of the (n,k)-bubble-sort network Bn,k in this paper, where the special structures are complete graphs.
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
