Node connectivity and arc connectivity of a fuzzy graph

  • Authors:

  • Sunil Mathew;M. S. Sunitha

  • Affiliations:

  • Department of Mathematics, Government Brennen College, Thalassery, Kannur 670 106, India;Department of Mathematics, National Institute of Technology, Calicut 673 601, India

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2010

Quantified Score

Hi-index 0.07

Visualization

Abstract

The fuzzy graph approach is more powerful in cluster analysis than the usual graph - theoretic approach due to its ability to handle the strengths of arcs effectively. The concept of node-strength sequence is introduced and is studied in a complete fuzzy graph. Two new connectivity parameters in fuzzy graphs namely, fuzzy node connectivity (@k) and fuzzy arc connectivity (@k^') are introduced and obtained the fuzzy analogue of Whitney's theorem. Fuzzy node cut, fuzzy arc cut and fuzzy bond are defined. Fuzzy bond is a special type of a fuzzy bridge. It is proved that at least one of the end nodes of a fuzzy bond is a fuzzy cutnode. It is shown that @k=@k^' for a fuzzy tree and it is the minimum of the strengths of its strong arcs. The relationships of the new parameters with already existing vertex and edge connectivity parameters are studied and is shown that the value of all these parameters are equal in a compete fuzzy graph. Also a new clustering technique based on fuzzy arc connectivity is introduced.