English

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 C3C_3 and C4C_4 vanes, and infinite families of 3,53,5-windmills and 3,63,6-windmills. Furthermore, we offer a new solution showing that the graph obtained from the union of tt 5-cycles with one vertex in common (C5tC_5^t) is graceful if and only if t0,3 ⁣ ⁣(mod4)t \equiv 0,3\!\!\pmod{4} and is near graceful when t1,2(mod4)t\equiv 1,2 \pmod{4}.

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

R2 v1 2026-06-24T08:08:57.863Z