Abstract
ABSTRACT In recent years, a growing number of concepts have been proposed to better assess network fault tolerance, among which the generalized -connectivity has been widely used in the research of fault tolerance of interconnection networks. For connected graph , refers to the maximum number of internally disjoint trees in to connect , where with . The generalized -connectivity of G . The -dimensional folded hypercube , as a hypercube-like network, is obtained by adding edges on -dimensional hypercube . In this paper, we discuss the generalized 4-connectivity of and show that for .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Computer Mathematics: Computer Systems Theory
Disclaimer: 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.