| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 394167 | Information Sciences | 2013 | 10 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Sunil Mathew, M.S. Sunitha,