Graceful labellings of variable windmills using Skolem sequences
Combinatorics
2021-12-09 v1
Abstract
In this paper, we introduce graceful and near graceful labellings of several families of windmills. In particular, we use Skolem-type sequences to prove (near) graceful labellings exist for windmills with and vanes, and infinite families of -windmills and -windmills. Furthermore, we offer a new solution showing that the graph obtained from the union of 5-cycles with one vertex in common () is graceful if and only if and is near graceful when .
Cite
@article{arxiv.2112.04265,
title = {Graceful labellings of variable windmills using Skolem sequences},
author = {Ahmad H. Alkasasbeh and Danny Dyer and Jared Howell},
journal= {arXiv preprint arXiv:2112.04265},
year = {2021}
}
Comments
38 pages (including 8 pages of appendices), 1 figure