3 research outputs found

    Graphs with largest number of minimum cuts

    Get PDF
    AbstractLet σ(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

    Zeta Functions and Periodic Orbit Theory: A Review

    No full text

    Beitrag zur �tiologie der Lichtdermatosen

    No full text
    corecore