On the switch-length of two connected graphs with the same degree sequence
Autor(a) principal: | |
---|---|
Data de Publicação: | 2022 |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10362/144030 |
Resumo: | 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 graphs with the same vertex set V such that for all v ∈ V, the degree of v in G1 is the same as in G2 . It is well known that G2 can be obtained from G1 by a sequence of switches. Moreover, there is one such sequences of switches with only connected graphs. For some classes of graphs, we study the problem of finding bounds for the minimum number of switches required for transforming G1 into G2 such that all graphs in the sequence are connected. |
id |
RCAP_1d61d65316053a67d4f34b930d238e91 |
---|---|
oai_identifier_str |
oai:run.unl.pt:10362/144030 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
On the switch-length of two connected graphs with the same degree sequenceDiscrete Mathematics and CombinatoricsLet 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 graphs with the same vertex set V such that for all v ∈ V, the degree of v in G1 is the same as in G2 . It is well known that G2 can be obtained from G1 by a sequence of switches. Moreover, there is one such sequences of switches with only connected graphs. For some classes of graphs, we study the problem of finding bounds for the minimum number of switches required for transforming G1 into G2 such that all graphs in the sequence are connected.CMA - Centro de Matemática e AplicaçõesDM - Departamento de MatemáticaRUNFernandes, Rosário2022-09-26T22:29:48Z2022-062022-06-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article14application/pdfhttp://hdl.handle.net/10362/144030eng1034-4942PURE: 44985050info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-03-11T05:23:05Zoai:run.unl.pt:10362/144030Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T03:51:16.544755Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
On the switch-length of two connected graphs with the same degree sequence |
title |
On the switch-length of two connected graphs with the same degree sequence |
spellingShingle |
On the switch-length of two connected graphs with the same degree sequence Fernandes, Rosário Discrete Mathematics and Combinatorics |
title_short |
On the switch-length of two connected graphs with the same degree sequence |
title_full |
On the switch-length of two connected graphs with the same degree sequence |
title_fullStr |
On the switch-length of two connected graphs with the same degree sequence |
title_full_unstemmed |
On the switch-length of two connected graphs with the same degree sequence |
title_sort |
On the switch-length of two connected graphs with the same degree sequence |
author |
Fernandes, Rosário |
author_facet |
Fernandes, Rosário |
author_role |
author |
dc.contributor.none.fl_str_mv |
CMA - Centro de Matemática e Aplicações DM - Departamento de Matemática RUN |
dc.contributor.author.fl_str_mv |
Fernandes, Rosário |
dc.subject.por.fl_str_mv |
Discrete Mathematics and Combinatorics |
topic |
Discrete Mathematics and Combinatorics |
description |
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 graphs with the same vertex set V such that for all v ∈ V, the degree of v in G1 is the same as in G2 . It is well known that G2 can be obtained from G1 by a sequence of switches. Moreover, there is one such sequences of switches with only connected graphs. For some classes of graphs, we study the problem of finding bounds for the minimum number of switches required for transforming G1 into G2 such that all graphs in the sequence are connected. |
publishDate |
2022 |
dc.date.none.fl_str_mv |
2022-09-26T22:29:48Z 2022-06 2022-06-01T00:00:00Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10362/144030 |
url |
http://hdl.handle.net/10362/144030 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
1034-4942 PURE: 44985050 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
14 application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799138107380989952 |