Generalized fuzzy Euler graphs and generalized fuzzy Hamiltonian graphs

Sovan Samanta, Biswajit Sarkar

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)3413-3419
Number of pages7
JournalJournal of Intelligent and Fuzzy Systems
Issue number3
Publication statusPublished - 2018

Bibliographical note

Funding Information:
This work was supported by the research fund of Hanyang University (HY-2018-F), (Project Number 201800000001370).

Publisher Copyright:
© 2018-IOS Press and the authors. All rights reserved.

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Engineering(all)
  • Artificial Intelligence


Dive into the research topics of 'Generalized fuzzy Euler graphs and generalized fuzzy Hamiltonian graphs'. Together they form a unique fingerprint.

Cite this