{'fraction_non_alphanumeric': 0.01951854261548471, 'fraction_numerical': 0.0071567989590110605, 'mean_word_length': 4.492857142857143, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
International Journal of On Sequential Join of Fuzzy Graphs

Sequential join of fuzzy graphs which is analogous to the concept sequential join operation in crisp graph theory is defined. The degree of an edge in sequential join of fuzzy graphs is obtained. Also, the degree of an edge in fuzzy graphs formed by this operation in terms of the degree of edges in the given fuzzy graphs in some particular cases is found. 1. Introduction It was Rosenfeld who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975 [9]. Later on, Bhattacharya gave some remarks on fuzzy graphs [1]. The operations of union, join, Cartesian product and composition on two fuzzy graphs were defined by Moderson and Peng [3]. The degree of a vertex in fuzzy graphs which are obtained from two given fuzzy graphs using these operations were discussed by Nagoor Gani and Radha [5]. Radha and Kumaravel introduced the concept of degree of an edge and total degree of an edge in fuzzy graphs [7] and studied about the degree of an edge in fuzzy graphs which are obtained from two given fuzzy graphs using the operations of union and join [8]. In this paper, we have introduced the concept of sequential join of fuzzy graphs, which are analogous to the concept sequential join in crisp graph theory. We study about the degree of an edge in fuzzy graphs which are obtained from three or more fuzzy graphs using sequential join operation. The degree of an edge in the sequential join of fuzzy graphs obtained in some particular case.