Graceful labellings of variable windmills using Skolem sequences

Publication date 8 December 2021

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

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

C_{3}

and

C_{4}

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 (

C_{5}^{t}

) is graceful if and only if

t e q u i v 0, 3!! p m o d 4

and is near graceful when

t e q u i v 1, 2 p m o d 4

.

This page was built for publication: Graceful labellings of variable windmills using Skolem sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6385115)