论文信息 - Graphs with Largest Number of Minimum Cuts

Graphs with Largest Number of Minimum Cuts

Abstract Let σ(n, k) be the largest number of k-cuts in a k-edge-connected multigraph with n vertices. We determine σ(n, k) and characterize extremal multigraphs for every n and k. The same problem is also investigated for graphs with no multiple edges.

Myriam Preissmann | Frédéric Maffray | Jenö Lehel

[1] E. BixbyR.. The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n-Bonds , 1975 .

[2] Harold Fredricksen. Generation of the Ford Sequence of Length 2n, n Large , 1972, J. Comb. Theory, Ser. A.

[3] Harold N. Gabow,et al. Applications of a poset representation to edge connectivity and graph rigidity , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[4] Toshihide Ibaraki,et al. Counting the number of minimum cuts in undirected multigraphs , 1991 .