Hamiltonian fuzzy graphs with application to human trafficking

•Generalizations of classic results by Bondy and Dirac.•Introduction of Hamilitonicity in fuzzy set up.•Algorithms and Applications. Bottlenecks create delay and traffic jams in interconnection networks. Allowing more paths and cycles of larger capacities can ease this problem to some extent. A path...

Full description

Saved in:
Bibliographic Details
Published inInformation sciences Vol. 550; pp. 268 - 284
Main Authors Ali, Shanookha, Mathew, Sunil, Mordeson, J N
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.03.2021
Subjects
Online AccessGet full text
ISSN0020-0255
1872-6291
DOI10.1016/j.ins.2020.10.029

Cover

More Information
Summary:•Generalizations of classic results by Bondy and Dirac.•Introduction of Hamilitonicity in fuzzy set up.•Algorithms and Applications. Bottlenecks create delay and traffic jams in interconnection networks. Allowing more paths and cycles of larger capacities can ease this problem to some extent. A path of maximum size is said to be a heavy path. In this paper, some results on heavy paths, heavy cycles and Hamilton cycles are presented. A generalization for Dirac’s theorem in graph theory is discussed in a fuzzy set up. Algorithms for the determination of heavy paths and heavy Hamilton cycles and an application of heavy paths in human trafficking are also proposed.
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2020.10.029