Graceful Tree Labelings

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.

Country

Spain

Related Organizations

Keywords

graphs, árboles graciosos, grafos, Graceful Trees, Arbres (Teoria de grafs), Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs, Trees (Graph theory), :Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs [Àrees temàtiques de la UPC]

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average