Abstract
In this paper, we consider graphs modeling interconnection networks of parallel systems and we deal with network simulations. More specifically, we focus on simulations involving Cartesian-product graphs and some subclasses of Cayley graphs. We study emulations based on graph homomorphisms and iso-retractions. In particular, we give necessary and sufficient conditions for the existence of an iso-retraction of a Cartesian product graph G□H onto graph G. Furthermore, we show that each uniform (in terms of the load of the vertices in the target graph) emulation of the hypercube Hn onto the hypercube Hn−1 is an iso-retraction. Finally, we deal with iso-retractions of transposition Cayley graphs.
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.
