Menger's theorem for fuzzy graphs

作者：Mathew Sunil^*; Sunitha M S

来源：Information Sciences, 2013, 222: 717-726.

DOI：10.1016/j.ins.2012.07.026

• Fuzzy set
• Fuzzy graph
• Strongest path
• Separating set
• Strength reducing set

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.

• 出版日期2013-2-10