PERFECT MATCHING IN COMPLETE INTUITIONISTIC FUZZY GRAPHS

Abstract

A induced sub graph ? H ? of a intuitionistic fuzzy graph G(V,E) is said to be a matching if every vertex of G(V,E)
is incident with at most a vertex in ? H ? .A induced fuzzy sub graph ? H ? of a intuitionistic fuzzy graph G(V,E)
is said to be a perfect matching if every vertex of G(V,E) is incident with exactly a vertex in ? H ? . We shall define a perfect matching in intuitionistic fuzzy graphs in this paper. We also look into the matching number's bounds and characteristics in a variety of intuitionistic fuzzy graphs