Title: Types of uncertain nodes in a fuzzy graph

Authors: Arindam Dey; Anita Pal

Addresses: Department of Computer Science and Engineering, Saroj Mohan Institute of Technology, Hooghly, India ' Department of Mathematics, National Institute of Technology, Durgapur, India

Abstract: The graph theory has numerous applications in the problems of operations research, economics, systems analysis, and transportation systems. However, real applications of a graph theory are full of linguistic vagueness, i.e., uncertainty. For example, the vehicle travel time or number of vehicles on a road network may not be known precisely. The fuzzy graph model can be used to model the complex, not clearly explained uncertain real life applications, in which conventional graph may fail to model properly. In a fuzzy graph, it is very important to identify the nature (strength) of nodes and no such analysis on nodes is available in the literature. In this paper, we introduce a method to find out the strength of the node in a fuzzy graph. The degree of the node and maximum membership value of the adjacent edges of that node are used to compute the strength of the node. The strength of a fuzzy node itself is a fuzzy set. Depending upon the strength of the nodes, we classify the nodes of a fuzzy graph into six types namely α strong fuzzy node, β strong fuzzy node, regular fuzzy node, α weak fuzzy node, β weak fuzzy node and balance fuzzy node.

Keywords: fuzzy graph; fuzzy set; fuzzy arc; fuzzy node; strong fuzzy node; weak fuzzy node.

DOI: 10.1504/IJAIP.2023.129181

International Journal of Advanced Intelligence Paradigms, 2023 Vol.24 No.3/4, pp.332 - 340

Received: 08 Sep 2017
Accepted: 03 Nov 2017

Published online: 01 Mar 2023 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article