Abstract
Let [Formula: see text] be a connected graph, and [Formula: see text] with [Formula: see text]. [Formula: see text] refers to the maximum number [Formula: see text] of edge-disjoint trees [Formula: see text] in [Formula: see text] such that [Formula: see text] for distinct [Formula: see text]. The generalized [Formula: see text]-connectivity of [Formula: see text], denoted by [Formula: see text], is defined as the minimum value of [Formula: see text] over all [Formula: see text] with [Formula: see text]. In fact, [Formula: see text] is exactly the traditional connectivity of [Formula: see text]. Exchanged crossed cube [Formula: see text], a variation of hypercube, has better properties than other variations of hypercube. In this work we obtain that [Formula: see text] with [Formula: see text].
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 callMore From: International Journal of Foundations of Computer Science
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.
