Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990566
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, May 13, 2014 - 4:19:38 PM
Last modification on : Thursday, July 26, 2018 - 3:20:10 PM
Long-term archiving on: : Monday, April 10, 2017 - 10:46:50 PM

File

1833-6974-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00990566, version 1

Collections

Citation

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, DMTCS, 2012, Vol. 14 no. 1 (1), pp.159-174. ⟨hal-00990566⟩

Share

Metrics

Record views

225

Files downloads

1533