Some Connectivity Parameters of Interval-Valued Intuitionistic Fuzzy Graphs with Applications

Abstract

Connectivity in graphs is useful in describing different types of communication systems like neural networks, computer networks, etc. In the design of any network, it is essential to evaluate the connections based on their strengths. In this manuscript, we comprehensively describe various connectivity parameters related to interval-valued intuitionistic fuzzy graphs (IVIFGs). These are the generalizations of the parameters defined for fuzzy graphs, interval-valued fuzzy graphs, and intuitionistic fuzzy graphs. First, we introduce interval-valued intuitionistic fuzzy bridges (IVIF bridges) and interval-valued intuitionistic fuzzy cut-nodes (IVIF cut-nodes). We discuss the many characteristics of these terms as well as establish the necessary and sufficient conditions for an arc to become an IVIF-bridge and a vertex to be an IVIF-cutnode. Furthermore, we initiate the concepts of interval-valued intuitionistic fuzzy cycles (IVIFCs) and interval-valued intuitionistic fuzzy trees (IVIFTs) and explore few relationships among them. In addition, we introduce the notions of fuzzy blocks and fuzzy block graphs and extend these terms as interval-valued fuzzy blocks (IVF-blocks) and interval-valued intuitionistic fuzzy block graphs (IVIF-block graphs). Finally, we provide the application of interval-valued intuitionistic fuzzy trees (IVIFTs) in a road transport network.