Mostra el registre d'ítem simple
Graceful Tree Labelings
dc.contributor | Balbuena Martínez, Maria Camino Teófila |
dc.contributor.author | Marti Bofill, Xavier |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III |
dc.date.accessioned | 2014-10-21T09:05:24Z |
dc.date.available | 2014-10-21T09:05:24Z |
dc.date.issued | 2012-10-26 |
dc.identifier.uri | http://hdl.handle.net/2099.1/23178 |
dc.description.abstract | The Graceful Tree Conjecture was published almost 40 years ago and nowadays it is still an open problem. It seems as difficult to solve as it is to enunciate: every tree admits a vertex labeling on 0, 1, ..., n-1 such that the set of values of the differences of the numbers assigned to the ends of each edge is the set {1, 2, ..., n-1}. This Thesis has two major parts. The first one is a review of the most remarkable advances towards the solution of the problem. The second one is a self-developed method to gracefully label trees using adjacency matrices. |
dc.language.iso | eng |
dc.publisher | Universitat Politècnica de Catalunya |
dc.rights | Attribution-NonCommercial-ShareAlike 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
dc.subject.lcsh | Trees (Graph theory) |
dc.subject.other | Graceful Trees |
dc.subject.other | graphs |
dc.subject.other | árboles graciosos |
dc.subject.other | grafos |
dc.title | Graceful Tree Labelings |
dc.title.alternative | Etiquetamiento gracioso de árboles |
dc.type | Minor thesis |
dc.subject.lemac | Arbres (Teoria de grafs) |
dc.identifier.slug | DOCUMENTUM-0b004e2180541a07 |
dc.rights.access | Open Access |
dc.date.updated | 2014-04-28T13:49:59Z |
dc.audience.educationlevel | Estudis de primer/segon cicle |
dc.audience.mediator | Escola Tècnica Superior d'Enginyers de Camins, Canals i Ports de Barcelona |
dc.audience.degree | ENGINYERIA DE CAMINS, CANALS I PORTS (Pla 1995) |