• Title of article

    Graphs with largest number of minimum cuts Original Research Article

  • Author/Authors

    Jen? Lehel، نويسنده , , Frédéric Maffray، نويسنده , , Myriam Preissmann، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1995
  • Pages
    21
  • From page
    387
  • To page
    407
  • 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.
  • Journal title
    Discrete Applied Mathematics
  • Serial Year
    1995
  • Journal title
    Discrete Applied Mathematics
  • Record number

    884355

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=884355