Object
Title: Gossiping Properties of the Edge-Permuted Knödel Graphs
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:
URL:
Affiliation:
Institute for Informatics and Automation Problems
Country:
Year:
Time period:
Conference title:
11th International Conference on Computer Science and Information Technologies CSIT 2017
Place:
Participation type:
Object collections:
- Digital Library > Academic Insitutions > Insitute for Informatics and Automation Problems of NAS RA > Conferences
Last modified:
Mar 3, 2021
In our library since:
Jul 15, 2020
Number of object content hits:
29
All available object's versions:
https://noad.sci.am/publication/149311
Show description in RDF format:
Show description in OAI-PMH format:
| Edition name | Date |
|---|---|
| Vilyam Hovnanyan, Gossiping Properties of the Edge-Permuted Knödel Graphs | Mar 3, 2021 |
