Pith. sign in

REVIEW

Graceful labellings of variable windmills using Skolem sequences

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2112.04265 v1 pith:UPJBZVIS submitted 2021-12-08 math.CO

classification math.CO
keywords gracefulwindmillslabellingsnearequivfamiliespmodsequences
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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 \equiv 0,3\!\!\pmod{4}$ and is near graceful when $t\equiv 1,2 \pmod{4}$.

Discussion (0). Continue with ORCID to comment.

Pith tools