No label defined (Q3689217)

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 3912422
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3912422

      Statements

      0 references
      1985
      0 references
      graph switching
      0 references
      2-vertex-connectivity
      0 references
      2-edge-connectivity
      0 references
      switching- complete properties
      0 references
      If a graph G contains edges ac, bd and not ad, bc, then the switching \(t=(abcd)\) of G is the transformation of G at which the edges ac, bd are deleted and the edges ad, bc added. A graph-theoretical property P is called switching-complete, if for any two graphs G, H with the same degree sequence and both having the property P there exists a finite sequence of graphs beginning with G, ending with H and with the property that all terms of the sequence have the property P and each of them is obtained from the preceding one by a switching. In the paper it is proved that the 2-vertex-connectivity and the 2-edge- connectivity are switching-complete properties. Further a lot of properties are listed which are not switching-complete.
      0 references

      Identifiers