Mostra el registre d'ítem simple

dc.contributorBalbuena Martínez, Maria Camino Teófila
dc.contributor.authorMarti Bofill, Xavier
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III
dc.date.accessioned2014-10-21T09:05:24Z
dc.date.available2014-10-21T09:05:24Z
dc.date.issued2012-10-26
dc.identifier.urihttp://hdl.handle.net/2099.1/23178
dc.description.abstractThe 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.isoeng
dc.publisherUniversitat Politècnica de Catalunya
dc.rightsAttribution-NonCommercial-ShareAlike 3.0 Spain
dc.rights.urihttp://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.lcshTrees (Graph theory)
dc.subject.otherGraceful Trees
dc.subject.othergraphs
dc.subject.otherárboles graciosos
dc.subject.othergrafos
dc.titleGraceful Tree Labelings
dc.title.alternativeEtiquetamiento gracioso de árboles
dc.typeMinor thesis
dc.subject.lemacArbres (Teoria de grafs)
dc.identifier.slugDOCUMENTUM-0b004e2180541a07
dc.rights.accessOpen Access
dc.date.updated2014-04-28T13:49:59Z
dc.audience.educationlevelEstudis de primer/segon cicle
dc.audience.mediatorEscola Tècnica Superior d'Enginyers de Camins, Canals i Ports de Barcelona
dc.audience.degreeENGINYERIA DE CAMINS, CANALS I PORTS (Pla 1995)


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple