Abstract—In many applications, information is naturally
represented as networks of interlinked agents. Any
communication has its costs and, therefore, the research of best
and fastest ways to exchange information is an important field in
applied mathematics. Graph theory, economic networks and,
more precisely in this article, the study of paths on ordered
edges in critical networks can by very fruitful in such modeling
problems. In this article we will consider the Gossips and
Telephones problem to illustrate such methods in Information
Networks modeling.
Index Terms—Graph theory, paths on ordered edges, gossip
problem.
Serge A. Tishchenko is with the Yamaguchi University, Yamaguchi,
Japan (e-mail: tichtch@yahoo.fr).
Alexander. K. Kovaldji is with the Litsey Vtoraya Shkola, Russia (e-mail:
koval-dji@yandex.ru).
[PDF]
Cite: Serge A. Tishchenko and Alexander K. Kovaldji, "Paths on Ordered Edges in Non-oriented Graphs and
Economic Networks Modeling," International Journal of Modeling and Optimization vol. 6, no. 4, pp. 233-237, 2016.
