| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1709090 | Applied Mathematics Letters | 2011 | 5 Pages |
Abstract
This paper generalizes one of the celebrated results in Graph Theory due to Karl. A. Menger (1927), which plays a crucial role in many areas of flow and network theory. This paper also introduces and characterizes strength reducing sets of nodes and arcs in weighted graphs.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Sunil Mathew, M.S. Sunitha,