Alpha labelings of full hexagonal caterpillars. Issue 1 (1st April 2016)

• Record Type: Journal Article
• Authors: Froncek, Dalibor
• Is Part Of: AKCE International Journal of Graphs and Combinatorics. Volume 13:Issue 1(2016)
• Page Start: 85
• Page End: 89
• Publication Date: 2016-04-01
• Subjects: Alpha labeling -- Graceful labeling -- Graph decomposition
• DOI: 10.1016/j.akcej.2016.03.003
• Languages: English
• ISSNs: 0972-8600

Abstract

Abstract: Barrientos and Minion (2015) introduced the notion of generalized snake polyomino graphs and proved that when the cells are either squares or hexagons, then they admit an alpha labeling. Froncek et al. (2014) generalized the notion by introducing straight simple polyominal caterpillars with square cells and proved that they also admit an alpha labeling. We introduce a similar family of graphs called full hexagonal caterpillars and prove that they also admit an alpha labeling. This implies that every full hexagonal caterpillar with edges decomposes the complete graph for any positive integer .