Generalized fuzzy Euler graphs and generalized fuzzy Hamiltonian graphs

Sovan Samanta; Biswajit Sarkar

doi:10.3233/JIFS-17322

Generalized fuzzy Euler graphs and generalized fuzzy Hamiltonian graphs

Sovan Samanta, Biswajit Sarkar

Department of Industrial Engineering

Research output: Contribution to journal › Article › peer-review

11 Citations (Scopus)

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.

Original language	English
Pages (from-to)	3413-3419
Number of pages	7
Journal	Journal of Intelligent and Fuzzy Systems
Volume	35
Issue number	3
DOIs	https://doi.org/10.3233/JIFS-17322
Publication status	Published - 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

Access to Document

10.3233/JIFS-17322

Cite this

@article{ad281e7c64ae4681bd33edea8b952f0f,

title = "Generalized fuzzy Euler graphs and generalized fuzzy Hamiltonian graphs",

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.",

author = "Sovan Samanta and Biswajit Sarkar",

note = "Funding Information: This work was supported by the research fund of Hanyang University (HY-2018-F), (Project Number 201800000001370). Publisher Copyright: {\textcopyright} 2018-IOS Press and the authors. All rights reserved.",

year = "2018",

doi = "10.3233/JIFS-17322",

language = "English",

volume = "35",

pages = "3413--3419",

journal = "Journal of Intelligent and Fuzzy Systems",

issn = "1064-1246",

publisher = "IOS Press",

number = "3",

}

TY - JOUR

T1 - Generalized fuzzy Euler graphs and generalized fuzzy Hamiltonian graphs

AU - Samanta, Sovan

AU - Sarkar, Biswajit

N1 - 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.

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85054848272&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85054848272&partnerID=8YFLogxK

U2 - 10.3233/JIFS-17322

DO - 10.3233/JIFS-17322

M3 - Article

AN - SCOPUS:85054848272

SN - 1064-1246

VL - 35

SP - 3413

EP - 3419

JO - Journal of Intelligent and Fuzzy Systems

JF - Journal of Intelligent and Fuzzy Systems

IS - 3

ER -

Generalized fuzzy Euler graphs and generalized fuzzy Hamiltonian graphs

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this