scientific article; zbMATH DE number 3912422
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.
- Transitivity of local complementation and switching on graphs.
- Unification of graph products and compatibility with switching
- On certain trees with the same degree sequence
- Integral graphs obtained by dual Seidel switching
- Some switching invariant prime graphs
- On one test for the switching separability of graphs modulo q
- On a connection between the switching separability of a graph and that of its subgraphs
- scientific article; zbMATH DE number 3841913 (Why is no real title available?)
- scientific article; zbMATH DE number 3841914 (Why is no real title available?)
- scientific article; zbMATH DE number 5548726 (Why is no real title available?)
- scientific article; zbMATH DE number 4057569 (Why is no real title available?)
- Graphs and degree sequences. I
- Switching in one-factorisations of complete graphs
- On 2-switches and isomorphism classes
- scientific article; zbMATH DE number 1409233 (Why is no real title available?)
- Switchings, extensions, and reductions in central digraphs
- An Algorithmic Study of Switch Graphs
- scientific article; zbMATH DE number 7535774 (Why is no real title available?)
- On homotopy of connected graphs having the same degree function
- Self-switching of union of two complete graphs
- A family of switch equivalent graphs
- On switching nonseparable graphs with switching separable subgraphs
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)