A study on Euler Graph and it's applications

Ashish Kumar

doi:https://doi.org/10.14445/22315373/IJMTT-V43P503

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 43 | Number 1 | Year 2017 | Article Id. IJMTT-V43P503 | DOI : https://doi.org/10.14445/22315373/IJMTT-V43P503

A study on Euler Graph and it's applications

Ashish Kumar

Citation :

Ashish Kumar, "A study on Euler Graph and it's applications," International Journal of Mathematics Trends and Technology (IJMTT), vol. 43, no. 1, pp. 9-15, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V43P503

Abstract

Main objective of this paper to study Euler graph and it’s various aspects in our real world. Now a day’s Euler graph got height of achievement in many situations that occur in computer science, physical science, communication science, economics and many other areas can be analysed by using techniques found in a relatively new area of mathematics. The graphs concerns relationship with lines and points (nodes). The Euler graph can be used to represent almost any problem involving discrete arrangements of objects where concern is not with the internal properties of these objects but with relationship among them. To achieve objective I first study basic concepts of graph theory, after that I summarizes the methods that are adopted to find Euler path and Euler cycle.

Keywords

graph theory, Konigsberg bridge problem, Eulerian circuit.

References

[1] Bhatt S., Even S., Greenberg D., and Tayar R. [2002]: “Traversing directed Eulerian mazes” Journal of Graph Algorithms and Applications, Vol. 6, Series 2, pp. 157–173.
[2] Chwe Byoung-Song [1994]: “A proof of some Schutzenberger type results for Eulerian paths and circuits on digraphs” International Journal of Mathematics and Mathematical Science, Vol. 17 No. 3, pp. 497-502.
[3] Dvorak Tomas, Havel Ivan and Liebl Petr [1997]: “Euler cycles in the complete graph K2m+1” Discrete Mathematics, Vol. 171, pp. 89-102.
[4] Isaev M. I. [2012]: “Asymptotic behaviour of the number of Eulerian circuits” Mathematics Company, arXiv:1104:3046v3
[5] Jonsson Jakob [2002]: “On the number of Euler trails in directed graphs” Mathematica Scandinavica, Vol. 90, pp. 191–214.
[6] Jordon Heather, Chartrand Gary and Zhang Ping [2014]: “A cycle decomposition conjecture for Eulerian graphs” Australian Journal of Combinatorics, Vol. 58, pp. 48–59.
[7] Khade R. H. and Chaudhari D. S. [2012]: “An approach for minimizing CMOS layout by applying Euler’s path rule” Proceedings published in International Journal of Computer Applications, Vol. 10, pp. 18-21
[8] Kotzig Anton and Turgeon M. Jean [1982]: “Quasi-groups defining Eulerian paths in Complete Graphs” Journal of Combinatorial Theory, Series B32, pp. 45-56.
[9] Mcdiarmid Lolin and Michael Molloy [2002]: “Edge-disjoint cycles in regular directed graph” Journal of Graph Theory, Vol. 22, Issue 3, pp. 231–237.
[10] Sarma Samar Sen, Basuli Krishnendu and Naskar Saptarshi [2008]: “Determination of Hamiltonian circuit and Euler trail from a given graphic degree sequence” Journal of Physical Sciences, Vol. 12, pp. 249-252.
[11] Shapira Asaf, Huang Hao, Ma Jie, Sudakov Benny andYuster Raphael [2012]: “Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs” Combinatorics, Probability and Computing, Vol. 22, Issue 06, pp. 859-873.
[12] Shen Jain and Brualdi A. Richard [2002]: “Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs” Journal of combinatorial theory, Series B 85, pp. 189–196.
[13] Subramanian K. G., Hasni Roslan and Ismail Abdul Samad [2009]: “Some applications of Eulerian graphs” International Journal of Mathematical Science Education, Vol. 2, Series 2, pp. 1 – 10.