Abstract
The problem of embedding an n-node graph G into an n-node graph H is an important aspect in parallel and distributed processing. Graph embedding results have been successfully used to establish equivalence of interconnections in parallel and distributed machines. The binary hypercube is one of the most widely used multiprocessor systems due to its simple, deadlock-free routing and broadcasting properties. The folded hypercube is an important variant of hypercube with the same number of nodes. Trees are the fundamental graph theoretical models in many fields including artificial intelligence and various network designs. In this paper, we consider the problem of embedding the hypercube and folded hypercube into the prism over a caterpillar in such a way as to minimise its layout.
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 Computer Aided Engineering and Technology
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.
