A theoretical investigation of regular equivalences for fuzzy graphs

AbstractThe notion of regular equivalence or bisimulation arises in different applications, such as positional analysis of social networks and behavior analysis of state transition systems. The common characteristic of these applications is that the system under modeling can be represented as a graph. Thus, regular equivalence is a notion used to capture the similarity between nodes based on their linking patterns with other nodes. According to Borgatti and Everett, two nodes are regularly equivalent if they are equally related to equivalent others. In recent years, fuzzy graphs have also received considerable attention because they can represent both the qualitative relationships and the degrees of connection between nodes. In this paper, we generalize the notion of regular equivalence to fuzzy graphs based on two alternative definitions of regular equivalence. While the two definitions are equivalent for crisp graphs, they induce different generalizations for fuzzy graphs. The first generalization, called regular similarity, is based on the characterization of regular equivalence as an equivalence relation that commutes with the underlying graph edges. The regular similarity is then a fuzzy binary relation that specifies the degree of similarity between nodes in the graph. The second generalization, called generalized regular equivalence, is based on the definition of coloring. A coloring is a mapping from the set of nodes to a set of colors. A coloring is regular if nodes that are mapped to the same color, have the same colors in their neighborhoods. Hence, generalized regular equivalence is an equivalence relation that can determine a crisp partition of the nodes in a fuzzy graph