This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
In the theoretical framework of graph embedding and network emulations, we show that the index-shuffle graph (a bounded-degreehypercube-like interconnection network, recently introduced by [ Baumslag and Obreni