Abstract
A problem in the design of bus interconnection networks is to find directed hypergraphs with minimum diameter for fixed values of the order, processor degree and bus size. We propose the partial line hyperdigraph as a technique for it. The partial line hyperdigraph is related to the line hyperdigraph (J.C. Bermond and F. Ergincan), the partial line digraph (M.A. Fiol and A.S. Llado, 1992) and the line digraph (M.A. Fiol et al., 1984). Partial line hyperdigraphs have also good connectivity, expandability and easy routing. Especially interesting results are obtained for the generalized Kautz hyperdigraphs.
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.
