The Concept of Network Flows for Fuzzy Hesitant Graphs

Abstract

The main aim of this paper is to study the maximum flow problem when the underlying associated structure is not well-defined and must be modeled as a fuzzy hesitant graph. However, to deal with the problem, we develop several well-known concepts from classical theory, in the fuzzy hesitant graph context, such as flow, network, and admissible flow.