𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A generalization of Menger's theorem for certain unicyclic graphs

✍ Scribed by E. Sampathkumar

Publisher
Springer Japan
Year
1992
Tongue
English
Weight
154 KB
Volume
8
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A generalization of Menger’s Theorem
A generalization of Menger’s Theorem
✍ Sunil Mathew; M.S. Sunitha πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 226 KB

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.

Vulnerability of scheduled networks and
Vulnerability of scheduled networks and a generalization of Menger's Theorem
✍ Berman, Kenneth A. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 859 KB

An edge-scheduled network N is a multigraph G = (V, E), where each edge e E E has been assigned two real weights: a start time a(e) and a finish time p(e). Such a multigraph models a communication or transportation network. A multiedge joining vertices u and v represents a direct communication (tran