New dense families of triple loop networks Original Research Article

Multi-loop digraphs are widely studied mainly because of their symmetric properties and their applications to loop networks. A multi-loop digraph G = G(N; s1, …, sA) has set of vertices V = ZN and adjacencies given by v → v + si mod N, i = 1, …, Δ. For every fixed N, an usual extremal problem is to find the minimum value =mins1…sδ∈ZND(N;s1…sδ where D(N; s1, …, sA) is the diameter of G. A closely related problem is to find the maximum number of vertices for a fixed value of the diameter. For Δ = 2, all optimal families have been found by using a geometrical approach. For Δ = 3, only some dense (but possibly not optimal) families are known. In this work some new dense families are given for Δ = 3 using a geometrical approach. This technique was already adopted in several papers for Δ = 2 (see for instance [7, 10]). These families improve all previous known results.