Abstract
Connectivity is a vital metric to explore fault tolerance and reliability of network structure based on a graph model. Let G=(V,E) be a connected graph. A connected graph G is called supper-κ (resp. super-λ) if every minimum vertex cut (edge cut) of G is the set of neighbors of some vertex in G. Let F⊆V be a vertex set, F is called extra-cut, if G−F is not connected and each component of G−F has more than k vertices. The extraconnectivity κk(G) is the cardinality of the minimum extra-cuts. A r-component cut of G is a set S of vertices, G−S has at least r components. r-component connectivity cκr(G) of G is the size of the smallest r-component cut. The r-component edge connectivity cλr(G) can be defined similarly. In this paper, we determine the r-component (edge) connectivity of twisted cubes TNn for small r. And we also prove other properties of TNn.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
