Connectivity Status of Intuitionistic Fuzzy Graphs and Its Applications

Abstract

The connectivity is one of the crucial parameters of network used to transport network flow, routing problems and bandwidth allocation problems. The increased connectivity makes a network more stable. In this paper, a new parameter called connectivity status of a vertex is introduced in the intuitionistic fuzzy graph. The related definitions and propositions of connectivity status of a vertex are proposed and investigated in an intuitionistic fuzzy graph. Specifically, connectivity status and status sequence are defined and analysed with various examples. After deleting a vertex, we classify the vertices of an intuitionistic fuzzy graph as connectivity status enhancing vertices, connectivity status neutral vertices and connectivity status reducing vertices because of the change of connectivity status. Finally, we establish two algorithms for these concepts and give an application to illustrate feasibility of algorithms.