Graceful labellings of variable windmills using Skolem sequences

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 C3 and C4 vanes, and infinite families of 3,5-windmills and 3,6-windmills. Furthermore, we offer a new solution showing that the graph obtained from the union of t 5-cycles with one vertex in common (C5t) is graceful if and only if t 0,3\!\!4 and is near graceful when t 1,2 4.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…