A generalization of Menger's Theorem

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.

[1]  Genghua Fan,et al.  Cycles in weighted graphs , 1991, Comb..

[2]  Sunil Mathew,et al.  Types of arcs in a fuzzy graph , 2009, Inf. Sci..

[3]  P. Erdgs,et al.  ON MAXIMAL PATHS AND CIRCUITS OF GRAPHS , 2002 .

[4]  P. Erdos,et al.  On maximal paths and circuits of graphs , 1959 .

[5]  Xueliang Li,et al.  Heavy paths and cycles in weighted graphs , 2000, Discret. Math..

[6]  Jan van den Heuvel,et al.  Heavy cycles in weighted graphs , 2002, Discuss. Math. Graph Theory.

[7]  Hikoe Enomoto,et al.  Long paths and large cycles in finite graphs , 1984, J. Graph Theory.

[8]  Sunil Mathew,et al.  Node connectivity and arc connectivity of a fuzzy graph , 2010, Inf. Sci..

[9]  J. A. Bondy,et al.  Optimal Paths and Cycles in Weighted Graphs , 1988 .

[10]  G. Dirac.  Some Theorems on Abstract Graphs , 1952 .

[11]  Martin Grötschel.  Graphs with Cycles Containing Given Paths , 1977 .

[12]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[13]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.