Abstract
The fault tolerability of the network is usually measured by the classical or generalized connectivity of the graph. For any subset with , a tree T is called an S-tree if . Furthermore, any two S-tree and are internally disjoint if and . We denote by the maximum number of pairwise internally disjoint S-trees in G. For an integer , the generalized k-connectivity of a graph G is defined as and . In this paper, we establish the generalized 4-connectivity of the Cayley graph generated by complete graphs.
Published Version
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 callMore From: International Journal of Parallel, Emergent and Distributed Systems
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.
