Hamiltonian fuzzy graphs with application to human trafficking

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. (C) 2020 Elsevier Inc. All rights reserved.

Automated summary

The paper discusses the alleviation of bottleneck issues in interconnection networks, with a focus on heavy paths and cycles, as well as a generalization of Dirac's theorem in graph theory. Algorithms for heavy paths and cycles determination, along with an application in human trafficking, are also proposed.