| DC Field | Value | Language |
|---|
| dc.contributor.author | FRESAN FIGUEROA, JULIAN ALBERTO | - |
| dc.contributor.author | RIVERA CAMPO, EDUARDO | - |
| dc.coverage.spatial | <dc:creator id="info:eu-repo/dai/mx/cvu/387267">JULIAN ALBERTO FRESAN FIGUEROA</dc:creator> | - |
| dc.coverage.spatial | <dc:creator id="info:eu-repo/dai/mx/cvu/5343">EDUARDO RIVERA CAMPO</dc:creator> | - |
| dc.coverage.temporal | <dc:subject>info:eu-repo/classification/cti/1</dc:subject> | - |
| dc.date.accessioned | 2021-06-07T18:41:14Z | - |
| dc.date.available | 2021-06-07T18:41:14Z | - |
| dc.date.issued | 2017 | - |
| dc.identifier.citation | Journal of Information Processing Vo. 25, 2017 | en_US |
| dc.identifier.uri | http://ilitia.cua.uam.mx:8080/jspui/handle/123456789/860 | - |
| dc.description.abstract | A 2-switch on a simple graph G consists of deleting two edges {u, v} and {x, y} of G and adding the edges {u, x} and {v, y}, provided the resulting graph is a simple graph. It is well known that if two graphs G and H have the same set of vertices and the same degree sequence, then H can be obtained from G by a finite sequence of 2-switches. While the 2-switch transformation preserves the degree sequence other conditions like connectivity may be lost. We study the restricted case where 2-switches are applied to trees to obtain trees. | en_US |
| dc.description.sponsorship | Information Processing Society of Japan | en_US |
| dc.language.iso | Inglés | en_US |
| dc.publisher | Tokio : Information Processing Society of Japan | en_US |
| dc.relation.haspart | 1882-6652 | - |
| dc.rights | https://doi.org/10.2197/ipsjjip.25.616 | - |
| dc.rights | https://www.jstage.jst.go.jp/article/ipsjjip/25/0/25_616/_pdf | - |
| dc.subject | Gráfico de árbol | en_US |
| dc.subject | Grado fijo | en_US |
| dc.subject | 2 interruptores | en_US |
| dc.title | On the fixed score tree graph | en_US |
| dc.type | Artículo | en_US |
| Aparece en las colecciones: | Artículos
|
