Abstract

Many problems of computer science, communication network, transportation systems, can be modeled into multigraphs (or graphs) and then can be solved. Nowadays, the networks are expanding very fast in huge volumes in terms of their nodes and the connecting links. For a given alive network, in many situations, its complete topology may not be always available to the communication systems at a given point of time because of the reason that few or many of its links (edges/arcs) may be temporarily disable owing to damage or attack or blockage upon them and of course they are under repair at that point of time. Such cases are now so frequent that it calls for rigorous attention of the researchers, in particular to those who are concerned with Quality of Service (QoS) while in a network. Even in most of the cases the cost parameters corresponding to its links are not crisp numbers, rather intuitionistic fuzzy numbers (or fuzzy numbers). Thus at any real time instant, the complete multigraph is not available but a submutigraph of it is available to the system for executing its communication or transportation activities. Under such circumstances, none of the existing algorithms on Shortest Path Problems (SPP) can work. In this study the authors propose a mathematical model for such types of multigraphs to be called by ‘Real Time Multigraphs’ (RT-multigraphs) in which all real time information (being updated every q quantum of time) are incorporated so that the communication/transportation system can be made very efficiently with optimal results. It is a kind of intuitionistic fuzzy mathematical model being the most generalized form of the crisp multigraphs. As a special case, RT-multigraphs reduce to the case of ‘RT-graphs’. Finally an intuitionistic fuzzy method is developed to solve the shortest path problem in a RT-Multigraph. As a special case the problem reduces to fuzzy shortest path problem in a RT-Multigraph.

Highlights

  • Graph theory has wide applications in several branches of Engineering, Science, Social Science, Medical Science, to list a few only out of many

  • Multigraph is a mathematical model which is a generalization of graph

  • The complete topology of the multigraph of a network may not be available to the system but a submultigraph of it

Read more

Summary

INTRODUCTION

Graph theory has wide applications in several branches of Engineering, Science, Social Science, Medical Science, to list a few only out of many. Graph theory has wide applications in several branches of Engineering, in particular in Computer Science, Communication systems, Civil Engineering and in, science, social science, optimization, management science, medical science, economics to list a few only out of many. In this study we propose a very generalized notion of ‘multigraphs’ which is a highly flexible and appropriate model as it incorporates the real time information of the network problem to facilitate the decision maker to search for an efficient and optimized results/solutions. We call such multigraphs by ‘Real Time Multigraphs’ or ‘RTmultigraphs’. Throughout in this study, we consider those multigraphs which are without loops

Preliminaries
Multigraph
Neighbor’ Node
Temporarily Blocked Neighbor and Reachable Node
1.10. Communicable Node
1.11. If Shortest Path in a RT-Multigraph
1.12. RT IF-Min Weight Arc-Set of a Directed RT-Multigraph
1.14. IF Relaxation of an Arc
1.16. Fuzzy Shortest Path in a RT-Multigraph
CONCLUSION

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.