On the switch-length of two connected graphs with the same degree sequence
Let G be a simple graph containing distinct vertices x, y, z, w such that the edges {x, y}, {z, w} ∈ G and {x, z}, {y, w} ∉ G. The process of deleting the edges {x, y}, {z, w} from G and adding {x, z}, {y, w} to G is referred to as a switch (or 2-switch) in G. Let G1 and G2 be two connected simple g...
| Autor principal: | |
|---|---|
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2022
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10362/144030 |
| País: | Portugal |
| Oai: | oai:run.unl.pt:10362/144030 |