Concepts of Picture Fuzzy Line Graphs and Their Applications in Data Analysis

Abstract

The process of bundling and clustering hasno clear boundaries; hence, their analysis contains uncertainities. Thus, it is more suitable to deal withbundling and clusteringby usingfuzzy graphs. Since picture fuzzy sets (PFSs) are more accurate, compatible, and flexible compared to the other generalizations of fuzzy sets (FSs),hence, it would be more effective to present edge bundling and clustering usingpicture fuzzy line graphs (PFLGs). The aim of our study is to introduce the notions of picture fuzzy intersection graphs (PFIGs) and picture fuzzy line graphs (PFLGs). These concepts are the generalizations of fuzzy intersection graphs (FIGs) and fuzzy line graphs (FLGs), respectively. We begin our discussion by introducing some fresh and useful terminologies in the theory of fuzzy graphs such as fuzzy intersection number, picture fuzzy intersection number, etc., and we explore few interesting results related to them. Based on these concepts, first we introduce the notion of picture fuzzy intersection graphs (PFIGs) and discuss manyimportant characteristics of these graphs. Afterwards, we introduce the notion of picture fuzzy line graphs (PFLGs) and discuss their various properties. We also investigate some structural properties of our newly established fuzzy graphs usingweak isomorphism and isomorphism. Finally, we provide an outline of the applications of picture fuzzy line graphs (PFLGs) in terms of cluster-based picture fuzzy edge bundling (CBPFEB) and the picture fuzzy c-mean algorithm. Since asymmetrical clusters ensure that the databases remain identical across the clusters, our study is deeply related to symmety.