Abstract
The triple-loop network associated with the hyper-L shape has been shown to have the best diameter among all triple-loop networks so far. In this paper we study the k- diameters of this network. In particular, we construct three node-disjoint shortest paths no longer than the diameter plus 2 for any pair of nodes.
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.
