Petersen graphs connected hypercube interconnection networks

On the basis of the short diameter of Petersen graph, and high connectivity of hypercube, an novel interconnection networks, PGCH(n) (Petersen graphs connected hypercube) is proposed and whose characteristics are studied simultaneously. It is proved that PGCH(n) is not only of regularity and good extensibility, but also of shorter diameter and better connectivity than those previous well-known interconnection networks such as Q_n, TQ_n, CQ_n and HP(n). In addition, the unicasting and broadcasting routing algorithms are designed for PGCH(n), whose communication efficiency are proved to be n-2 and n-4 respectively.