On restricted connectivity and extra connectivity of hypercubes and folded hypercubes (Q2574474)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2230851
Language Label Description Also known as
default for all languages
No label defined
    English
    On restricted connectivity and extra connectivity of hypercubes and folded hypercubes
    scientific article; zbMATH DE number 2230851

      Statements

      On restricted connectivity and extra connectivity of hypercubes and folded hypercubes (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      21 November 2005
      0 references
      The \(h\)-extra connectivity of a graph \(G\) is the minimum cardinality of a set of vertices of \(G\) whose deletion disconnects \(G\) and every remaining component has order more than \(h\). The \(h\)-restricted connectivity of \(G\) is the minimum cardinality of a set of vertices of \(G\) in which at least \(h\) neighbors of any vertex are not included, whose deletion disconnects \(G\) and every remaining component has the minimum degree of vertex at least \(h\). The authors establish the \(h\)-extra connectivity and \(h\)-restricted connectivity of hypercubes and folded hypercubes for \(h = 1\) and 2.
      0 references
      conditional connectivity
      0 references

      Identifiers