alpha-Labelings and the Structure of Trees with Nonzero alpha-Deficit - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2012

alpha-Labelings and the Structure of Trees with Nonzero alpha-Deficit

Abstract

We present theoretical and computational results on alpha-labelings of trees. The theorems proved in this paper were inspired by the results of a computer investigation of alpha-labelings of all trees with up to 26 vertices, all trees with maximum degree 3 and up to 36 vertices, all trees with maximum degree 4 and up to 32 vertices and all trees with maximum degree 5 and up to 31 vertices. We generalise a criterion for trees to have nonzero alpha-deficit, and prove an unexpected result on the alpha-deficit of trees with a vertex of large degree compared to the order of the tree.
Fichier principal
Vignette du fichier
1833-6974-1-PB.pdf (372.31 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00990566 , version 1 (13-05-2014)

Identifiers

Cite

Gunnar Brinkmann, Simon Crevals, Hadrien Melot, Leanne Rylands, Eckhard Steffen. alpha-Labelings and the Structure of Trees with Nonzero alpha-Deficit. Discrete Mathematics and Theoretical Computer Science, 2012, Vol. 14 no. 1 (1), pp.159-174. ⟨10.46298/dmtcs.569⟩. ⟨hal-00990566⟩

Collections

TDS-MACS
89 View
1516 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More