scientific article; zbMATH DE number 3912422

From MaRDI portal
Publication:3689217





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.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3689217)