Linear Diophantine fuzzy graphs with new decision-making approach

Abstract

The concept of linear Diophantine fuzzy set (LDFS) is a new mathematical tool for optimization, soft computing, and decision analysis. The aim of this article is to extend the notion of graph theory towards LDFSs. We initiate the idea of linear Diophantine fuzzy graph (LDF-graph) as a generalization of certain theoretical concepts including, q-rung orthopair fuzzy graph, Pythagorean fuzzy graph, and intuitionistic fuzzy graph. We extend certain properties of crisp graph theory towards LDF-graph including, composition, join, and union of LDF-graphs. We elucidate these operations with various illustrations. We analyze some interesting results that the composition of two LDF-graphs is a LDF-graph, cartesian product of two LDF-graphs is a LDF-graph, and the join of two LDF-graphs is a LDF-graph. We describe the idea of homomorphisms for LDF-graphs. We observe the equivalence relation via an isomorphism between LDF-graphs. Some significant results related to complement of LDF-graph are also investigated. Lastly, an algorithm based on LDFSs and LDF-relations is proposed for decision-making problems. A numerical example of medical diagnosis application is presented based on proposed approach.