Browsing by Subject "Finite Simple Graph"

Sort by: Order: Results:

  • Mader, W. (Cambridge : Cambridge University Press, 1994)
    All digraphs are determined that have the property that when any vertex and any edge that are not adjacent are deleted, the connectivity number decreases by two. © 1994, Cambridge University Press. All rights reserved.
  • Mader, W. (Cambridge : Cambridge University Press, 1995)
    Let G be a minimally n-edge-connected finite simple graph with vertex number |G| ≥ 2n + 2 + [3/n] and let n ≥ 3 be odd. It is proved that the number of vertices of degree n in G is at least ((n − 1 − ∈n)/(2n + 1))|G| + 2 ...