Applying Skolem Sequences to Gracefully Label New Families of Triangular Windmills
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:7O6ENW27record.jsonopen to challenge →
classification
math.CO
keywords
gracefuledgegraphlabellabellingtriangularapplyingassigned
read the original abstract
A function $f$ is a \textit{graceful labelling} of a graph $G=(V,E)$ with $m$ edges if $f$ is an injection $f:V\mapsto \{0,1,2,\dots,m\}$ such that each edge $uv \in E$ is assigned the label $|f(u)-f(v)|$, and no two edge labels are the same. If a graph G has a graceful labelling, we say that $G$ itself is graceful. In this paper, we prove any Dutch windmill with three pendant triangles is (near) graceful, which settles Rosa's conjecture for a new family of triangular cacti.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.