Graceful Tree Labelings
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2099.1/23178
Correu electrònic de l'autorxavier.marti-bofillestudiant.upc.edu
Tipus de documentTesina
Data2012-10-26
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-CompartirIgual 3.0 Espanya
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.
TitulacióENGINYERIA DE CAMINS, CANALS I PORTS (Pla 1995)
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Xavier Martí Bofill - Graceful Tree Labelings.pdf | 12,37Mb | Visualitza/Obre |