TY - JOUR UR - http://lib.ugent.be/catalog/pug01:3047437 ID - pug01:3047437 LA - eng TI - α-Labelings and the structure of trees with nonzero α-deficit PY - 2012 JO - (2012) DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE SN - 1462-7264 PB - 2012 AU - Brinkmann, Gunnar AU - Crevals, Simon UGent AU - Mélot, Hadrien AU - Rylands, Leanne AU - Steffen, Eckhard AB - 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. ER -Download RIS file
00000nam^a2200301^i^4500 | |||
001 | 3047437 | ||
005 | 20181113145025.0 | ||
008 | 121105s2012------------------------eng-- | ||
022 | a 1462-7264 | ||
024 | a 000305185800005 2 wos | ||
024 | a 1854/LU-3047437 2 handle | ||
040 | a UGent | ||
245 | a α-Labelings and the structure of trees with nonzero α-deficit | ||
246 | a alpha-Labelings and the structure of trees with nonzero alpha-deficit | ||
260 | c 2012 | ||
520 | a 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. | ||
598 | a A1 | ||
700 | a Brinkmann, Gunnar u WE02 0 801001807792 9 F6F54A7A-F0ED-11E1-A9DE-61C894A0A6B4 | ||
700 | a Crevals, Simon u UGent 0 002003425973 9 0D980E02-F0EE-11E1-A9DE-61C894A0A6B4 | ||
700 | a Mélot, Hadrien u WE02 0 802000731879 9 2694EC68-F0EE-11E1-A9DE-61C894A0A6B4 | ||
700 | a Rylands, Leanne | ||
700 | a Steffen, Eckhard | ||
650 | a Mathematics and Statistics | ||
653 | a GRACEFUL | ||
653 | a Graceful Tree Conjecture | ||
653 | a alpha-deficit | ||
653 | a alpha-labeling | ||
773 | t DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE g Discret. Math. Theor. Comput. Sci. 2012. 14 (1) p.159-174 q 14:1<159 | ||
856 | 3 Full Text u https://biblio.ugent.be/publication/3047437/file/5748774 z [open] y alpha_labellings.pdf | ||
920 | a article | ||
Z30 | x WE 1 WE02 | ||
922 | a UGENT-WE |
All data below are available with an Open Data Commons Open Database License. You are free to copy, distribute and use the database; to produce works from the database; to modify, transform and build upon the database. As long as you attribute the data sets to the source, publish your adapted database with ODbL license, and keep the dataset open (don't use technical measures such as DRM to restrict access to the database).
The datasets are also available as weekly exports.