TY - JOUR
AU - Rehman, Fahad Ur
AU - Rashid, Tabasam
AU - Hussain, Muhammad Tanveer
PY - 2022/03/28
Y2 - 2024/08/08
TI - Optimization in Business Trade by Using Fuzzy Incidence Graphs
JF - Journal of Computational and Cognitive Engineering
JA - JCCE
VL - 2
IS - 3
SE - Research Articles
DO - 10.47852/bonviewJCCE2202176
UR - https://ojs.bonviewpress.com/index.php/JCCE/article/view/176
SP - 196-203
AB - <p>In classical graph theory, set of vertices in which every edge is incident to at least one of the vertex is called a vertex covering set and the problems of vertex covering (<em>V C</em>) are known as <em>V C </em>problems. The classical graphs do not reflflect the impact of vertex on the edge and such impact is reflflected in fuzzy incidence graphs (<em>F IGs</em>). We used optimization technique in a trade using clique covering (<em>CC</em>) in fuzzy incidence graphs (<em>F IGs</em>). This article includes, some basic defifinitions such as strength of clique(<em>SC</em>), strength of path (<em>SP</em>), strength of minimum clique (<em>SMC</em>), acceptable strength of path (<em>ASP</em>) and clique (<em>ASC</em>), robust number (<em>RN</em>), minimum covering number of the clique (<em>MCNC</em>), close measure <em>CM</em>, some examples and theorems in <em>F IGs</em>, new strategy of optimization to characterize and solve facility points problems by adopting the <em>CC </em>application of <em>F IGs </em>for a business alliance to get maximum total achievement by reducing the transportation cost. This procedure will be helpful to develop sustainable economic developmental goal of the world. Some already existing theorems in fuzzy graphs (<em>F Gs</em>) are also checked in <em>F IGs</em>. A mathematical model is defifined and a real life problem from a trade is solved keeping the fuzziness of the objects related to fuzzy incidence graph.</p><p> </p><p><strong>Received</strong>: 22 February 2022 | <strong>Revised</strong>: 14 March 2022 | <strong>Accepted</strong>: 24 March 2022</p><p> </p><p><strong>Conflicts of Interest</strong></p><p>The authors declare that they have no conflicts of interest to this work.</p>
ER -