Gossiping properties of the edge-permuted Knödel graphs

Abstract

In this paper we consider the gossiping process implemented on several modifications of Knödel graphs. We show the ability of Knödel graphs to remain good network topology for gossiping even in case of cyclic permutation of the weights of its edges. We show that the modified graphs are still able to gossip and not isomorphic to Knödel graphs for any even value of n. The results obtained in this paper makes it possible to construct edge-disjoint paths between any pairs of vertices in the Knödel graph.