MAXIMUM STRENGTH OF CONNECTEDNESS IN RAMSEY COMPLETE FUZZY GRAPHS WITH RAMSEY FUZZY CLIQUE AND ITS APPLICATION

MAXIMUM STRENGTH OF CONNECTEDNESS IN RAMSEY COMPLETE FUZZY GRAPHS WITH RAMSEY FUZZY CLIQUE AND ITS APPLICATION

The Ramsey fuzzy clique and its application to connectedness in Ramsey complete fuzzy graphs were extensively covered in this research study. The Ramsey number is the fewest number of nodes n= R(s,t) needed for any simple graph of order n to have either a clique of order s or an anti clique of order t. Along with the recently announced Ramsey complete fuzzy graph and several related conclusions, this paper also introduces the concept of maximum strength of connectedness and Ramsey Fuzzy cliques in fuzzy graphs. Additionally, we discuss some theorems, corollaries, and conclusions based on Ramsey complete fuzzy graphs.