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. © 2011 Elsevier Ltd. All rights reserved.
Mathew, S., & Sunitha, M. S. (2011). A generalization of Menger’s Theorem. Applied Mathematics Letters, 24(12), 2059–2063. https://doi.org/10.1016/j.aml.2011.05.042