Abstract
The tree connectivity, as a generalization of the traditional connectivity, can serve to measure the capability of connection for vertices in a network. The (n,k)-star graph Sn,k can be used to model the topological structure of a large-scale parallel processing system. We show in this article that the 4-set tree connectivity of Sn,k is n−2, that is, there exist (n−2) internally disjoint trees connecting x,y,z and w in Sn,k for four arbitrary vertices x,y,z and w of Sn,k. Two known results about the 3-set tree connectivity of star graphs and (n,k)-star graphs are immediate consequences of our result.
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.
