• On the vulnerability of some families of graphs 

      Moreno Casablanca, Rocío; Díanez, Ana R.; García-Vázquez, Pedro (Iniciativa Digital Politècnica, 2011)
      Text en actes de congrés
      Accés obert
      The toughness of a noncomplete graph G is defined as τ (G) = min{|S|/ω(G − S)}, where the minimum is taken over all cutsets S of vertices of G and ω(G − S) denotes the number of components of the resultant graph G − S by ...