Menger's theorem for fuzzy graphs

  • Authors:

  • Sunil Mathew;M. S. Sunitha

  • Affiliations:

  • Department of Mathematics, National Institute of Technology, Calicut 670 601, India;Department of Mathematics, National Institute of Technology, Calicut 673 601, India

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

Quantified Score

Hi-index 0.07

Visualization

Abstract

The concept of the strongest path plays a crucial role in fuzzy graph theory. In classical graph theory, all paths in a graph are strongest, with a strength value of one. In this article, we introduce Menger's theorem for fuzzy graphs and discuss the concepts of strength-reducing sets and t-connected fuzzy graphs. We also characterize t-connected and t-arc connected fuzzy graphs.