Balanced k-Partitioned Fuzzy Graph

  • et al.
Citations of this article
Mendeley users who have this article in their library.
Get full text


In this paper, a balanced k-partitioned fuzzy graph is introduced from the definition of k-partitioned fuzzy graph. In recent days, partitioning graph has widely applied in the field of clustering, circuit design and in all networks. Extending the concept of k partitioned fuzzy graph, we have proposed a new partitioning of a fuzzy graph which is balanced using a density formula for k-partitioned fuzzy graph. Also studied how it differs from completely balanced k-partitioned fuzzy graph. Star density of k-partitioned fuzzy graph is defined and star balanced k-partitioned fuzzy graph is introduced using the definition. With an example, we explain the functioning of the concepts and related theorems are worked in this paper.




A, K., Roseline J*, J., & T, P. (2019). Balanced k-Partitioned Fuzzy Graph. International Journal of Innovative Technology and Exploring Engineering, 9(2), 269–275.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free