This paper has introduced a new concept which is partitioning of any fuzzy graph into k-partitioning fuzzy graphs by clustering the vertices of the fuzzy graph. The belongingness of the vertices is arranged as an array and partitioned into k disjoint subsets, such that all subsets have more or less equal sum. Some properties of k-partitioning fuzzy graph by order and size of partitioned fuzzy graph are discussed in this paper.
Keywords and Phrases
Fuzzy graph, 2-partitioned fuzzy graph, 3- partitioned fuzzy graph, 4-partitioned fuzzy graph, k-partitioned fuzzy graph, Strict k-partitioned fuzzy graph.
A.M.S. subject classiﬁcation