Co-author(s) :

Poghosyan Vahagn ; Poghosyan Suren

Abstract:

In this paper we consider the gossiping process implemented on several modifications of Kn¨odel graphs. We show the ability of Kn¨odel 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¨odel 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¨odel graph.

Identifier:

oai:noad.sci.am:135784

Language:

English

URL:

Affiliation:

Institute for Informatics and Automation Problems

Country:

Armenia

Year:

2017

Time period:

September25-29

Conference title:

11th International Conference on Computer Science and Information Technologies CSIT 2017

Place:

Yerevan

Participation type:

oral