The paper presents as background several graphs referred to (delta, D) digraphs including the Hypercube and de Bruijn. It shows the major disadvantages when implementing these topologies on chip interconnection networks. Then, the paper presents the "Small-World Heuristic" (SWH), which aims to find a network topology for a large number of nodes that has a maximum out degree and a small diameter, while maintaining an acceptable level of connectivity. It is proposed that this heuristic can be used to determine a compromise between Hypercube and de Bruijn when implementing networks on FPGA or in VLSI.

Graphs with a minimum diameter have applications in the design of building-block switching systems, communication networks [1], and distributed computer systems [2]. Several methods of constructing directed graphs with a small diameter are proposed [3]. This paper presents a heuristic network topology that allows a wide trade-off between node degree, and diameter. This called "Small-World Heuristic" (SWH) that feature minimum diameter properties using only nodes of degree 4. The "SWH" is highly clustered like a regular graph where the edges are randomly rewired with a gaussian distribution and has a small characteristic path length, like a random graph. This heuristic explores different graphs to suitable for large parallel computer networks.