Full Paper View


Usage of Eulerian and Hamiltonian Graph in Pandemic Situation

Ambrish Kumar Pandey, Shriya Kanchan,
Research Paper | Journal Paper
Volume 1 , Issue 1 , PP 1-8
DOI: https://doi.org/10.54060/JASE/001.01.002


The existence of Euler and Hamiltonian graph make it easier to solve real life problem. During the time of pandemic “Covid -19” it is very essential for each one of us to be vaccinated. Vaccination is done in the hospitals by using Eulerian and Hamiltonian graph not only prevent people from infecting but also increase the speed of vaccination. In this paper, authors have discussed the use of graph theory to effectively handle the covid – 19 pandemic situations in the allocation of patients to appropriate hospitals. The work done in this paper, may be utilized for the hospital – patient management as well as for the study by upcoming researchers to utilize the graph theory in any complicated situations.

Key-Words / Index Term

Graph, Eulerian, Hamiltonian, path, circuit, pandemic, hospital


  1. Sutaria, “A Hamiltonian and Eulerian cycles”, International Journal of Mathematics Trend and Technology, vol. 3, iss. 5, pp. 208-212, 2016.
  2. Kumar and SHUATS, “A study on Euler Graph and it’s applications,” Int. j. math. trends technol., vol. 43, no. 1, pp. 9–15, 2017.
  3. Ahmed, “Graph routing problem using Euler’s theorem and its applications,” Engineering Mathematics, vol. 3, no. 1, p. 1, 2019.
  4. Fleischner, “(Some of) the many uses of Eulerian graphs in graph theory (plus some applications),” Discrete Math., vol. 230, no. 1–3, pp. 23–43, 2001.
  5. S. Rahman and M. Kaykobad, “On Hamiltonian cycles and Hamiltonian paths,” Inf. Process. Lett., vol. 94, no. 1, pp. 37–41, 2005.
  6. Keshavarz-Kohjerdi and A. Bagheri, “Hamiltonian paths in some classes of grid graphs,” J. Appl. Math., vol. 2012, pp. 1–17, 2012.
  7. ?. Waligóra, “Application of Hamilton’s graph theory in new technologies,” World Scientific News, vol. 89, pp. 65–76, 2017.
  8. A. L. T. Cherin Monish Femila, “Hamiltonian cycle and Hamiltonian path decomposition of fan graphs,” International Journal of Scientific Research in Mathematical and Statistical Sciences, vol. 6, no. 2, pp. 207–211.
  9. Alhalabi, O. Kitanneh, A. Alharbi, Z. Balfakih, and A. Sarirete, “Efficient solution for finding Hamilton cycles in undirected graphs,” Springerplus, vol. 5, no. 1, p. 1192, 2016.
  10. ChandraBora and B. Kalita, “Particular Type of Hamiltonian Graphs and their Properties,” Int. J. Comput. Appl., vol. 96, no. 3, pp. 31–36, 2014.