Extended Petersen networks

A new type of network growth rule is studied, which comprises nodes adding, plus a rewiring procedure, and replacing of nodes with the complete bipartite graph K2,3 acting on Petersen graph. The 3-regular extended Petersen networks have 0 clustering coefficient, short diameter, high connectivity and the Hamilton path. All these properties play an important role in the information transfer of the network, as they cannot only increase the security but also save time and system resources.