International Journal of Advanced Networking and Applications

Open Access Open Access  Restricted Access Subscription Access

Application of Graph Theory in Online Network Services to Determine the Shortest Journey


Affiliations
1 Department of Humanities and Science, Rajalakshmi Institute of Technology, Chennai, 602124, India
 

In this paper, we determine the shortest route in online network services by applying the concept of graph theory. The investigation shows how the journey can be visualized as graphs in the nature of vertices and edges. In our research paper, the smallest distance from starting point to final destination is estimated using google map which provides the smallest cumulative cost. In this paper, our focus is to achieve the process in working of google map services using graph theoretical approach to determine the shortest journey and its implementation in computer science using Floyd Warshall algorithm. In this paper, we also give illustrations and prove some results.

Keywords

Distance Graph, Online Network Services, Shortest Route Problem, Floyd Warshall Algorithm.
User
Notifications
Font Size

  • Akinwol Agnes Kikelomo, Yekini Nureni Asafe, Adelokun Paul and N. Lawal Olawale, Design and Implementation of Mobile Map Application for Finding Shortest Direction between Two Pair Locations Using Shortest Path Algorithm: A Case Study, Int. J. Advanced Networking and Applications, 9(1), 2017, 3300-3305.

  • K.S. Avdhesh, and K. Sourabh, Finding of Shortest Path from Source to Destination by traversing every node in wired Network, International Journal of Engineering and Technology, 5, 2013, 2655-2656.

  • N.L. Biggs, Algebraic Graph Theory, (Cambridge University Press, Cambridge, 1993).

  • A.K. Bincy, and B. Jeba Presitha, Graph Coloring and its Real Time Applications an Overview, International Journal of Mathematics and its Applications, 5(4), 2017, 845-849.

  • B. Bollobas, (1990), Graph Theory: An Introductory Course, (Springer, New York , 1990), 3rd corrected edition.

  • Cristina Dalfo and Miquel Angel Fiol, Graphs, friends and acquaintances, Electronic Journal of Graph Theory and Applications, 6(2), 2018, 282-305.

  • R. Diestel, Graph Theory, (Springer, New York, 1997).

  • C.D. Godsil, and G. Royle, G., Algebraic Graph Theory, (Springer-Verlag, New York, 2001).

  • F. Harary, F., Graph Theory, (Addison-Wesley, Reading, MA, 1969).

  • J.L. Hyun, and D.K. Soo, A service-based approach to developing Android Mobile Internet Device (MID) applications, Service-Oriented Computing and Applications, 2010.

  • H. Mojo, Graph theory (2016). Available at www.en.m.wikipedia.org/wiki/Graph_Theoy.

  • Narasingh Deo, Graph theory with applications to engineering and computer science, (Prentice Hall of India, 1990).

  • Pranav Patel and Chirag Patel, Various graphs and their applications in real world, International Journal of Engineering Research & Technology (IJERT), 2(12), 2013.

  • S.G. Shirinivas, S. Vetrivel, and N.M. Elango, Application of Graph theory in Computer Science an overview, International Journal of Engineering Science and Technology, 2010.

  • S. Venu Madhava Sarma, Applications of graph theory in human life, International Journal of Computer Application, 1(2), 2012.

  • D.B. West, Introduction to Graph Theory, (Prentice-Hall, Englewood Cliffs, NJ, 2nd edition, 2000).


Abstract Views: 198

PDF Views: 0




  • Application of Graph Theory in Online Network Services to Determine the Shortest Journey

Abstract Views: 198  |  PDF Views: 0

Authors

B. Logeshwary Natarajan
Department of Humanities and Science, Rajalakshmi Institute of Technology, Chennai, 602124, India
M. K. Balaji
Department of Humanities and Science, Rajalakshmi Institute of Technology, Chennai, 602124, India

Abstract


In this paper, we determine the shortest route in online network services by applying the concept of graph theory. The investigation shows how the journey can be visualized as graphs in the nature of vertices and edges. In our research paper, the smallest distance from starting point to final destination is estimated using google map which provides the smallest cumulative cost. In this paper, our focus is to achieve the process in working of google map services using graph theoretical approach to determine the shortest journey and its implementation in computer science using Floyd Warshall algorithm. In this paper, we also give illustrations and prove some results.

Keywords


Distance Graph, Online Network Services, Shortest Route Problem, Floyd Warshall Algorithm.

References