Journal or Publication Title:
Date of publication:
Volume:
ISSN:
Additional Information:
Title:
Gossiping Properties of the Modified Knödel Graphs
Other title:
Creator:
Subject:
Uncontrolled Keywords:
Graphs ; Networks ; Telephone problem ; Gossip problem ; Knödel graphs.
Coverage:
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 its edge weights. The results shown in this paper could help us to construct edge-disjoint paths between any pairs of vertices of the Knödel graph.