Abstract
This paper deals with fuzzy clique covers in fuzzy graphs. The definition of a fuzzy clique is modified so that the fuzzy subgraph induced by each fuzzy clique is complete. Then, fuzzy cliques and maximal fuzzy cliques are characterized. Finally, fuzzy clique covers and minimum fuzzy clique covers in fuzzy graphs are introduced and characterized, and an algorithm to find a minimum fuzzy clique cover of a given fuzzy graph is also presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have