• Dec 31, 2019 News!Welcome Assoc. Prof. David E. Breen from USA to join the Editorial board of IJMO.   [Click]
  • Feb 07, 2023 News!IJMO will adopt Article-by-Article Work Flow   [Click]
  • May 13, 2022 News!Vol. 12, No. 3 has been published with online version.   [Click]
General Information
Prof. Adrian Olaru
University Politehnica of Bucharest, Romania
I'm happy to take on the position of editor in chief of IJMO. It's a journal that shows promise of becoming a recognized journal in the area of modelling and optimization. I'll work together with the editors to help it progress.
IJMO 2016 Vol.6(4): 233-237 ISSN: 2010-3697
DOI: 10.7763/IJMO.2016.V6.532

Paths on Ordered Edges in Non-oriented Graphs and Economic Networks Modeling

Serge A. Tishchenko and Alexander K. Kovaldji
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).


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.

Copyright © 2008-2023. International Journal of Modeling and Optimization. All rights reserved.
E-mail: ijmo@iacsitp.com