Affiliations: [a] Department of Mathematics, Tamralipta Mahavidyalaya, West Bengal, India | [b] Department of Industrial and Management Engineering, Hanyang University, Ansan Gyeonggi-do, Korea
Correspondence:
[*]
Corresponding author. Biswajit Sarkar, Department of Industrial and Management Engineering, Hanyang University, Ansan Gyeonggi-do, 15588, Korea. E-mail: bsbiswajitsarkar@gmail.com.
Abstract: Graph theory includes two unavoidable graphs, namely Euler graphs and Hamiltonian graphs. In this study, generalized fuzzy Euler graphs (GFEGs) and generalized fuzzy Hamiltonian graphs (GFHGs) are defined to express uncertain system like routes, networks. Here, even degrees of all vertices of graphs do not assure that the graphs are GFEG. Similarly, other properties of crisp Euler graphs and crisp Hamiltonian graphs are tested. Two algorithms are prepared to find Eulerian circuit in GFEGs and Hamiltonian circuit in GFHGs. In modern life, planning of efficient routes is very important for business and industry purposes. An application on planning of routes is described.
