SEFP:A New Cayley interconnection Network of degree four
Baoxing Chen · 2002
In this paper, we propose a family of new regular Cayley networks of degree 4 based on permutation groups. We have shown that its diameter is only about half of that of SEP[5].These graph are shown to be able to efficiently simulate or embed other permutation group based graphs; thus they seem to be very attractive for VLSI implementation and for applications requiring bounded number of I/O ports.