scientific article; zbMATH DE number 3887748
From MaRDI portal
Publication:3222239
[For the entire collection see Zbl 0546.00007.] A numbering of graph G with m edges assigns to each vertex a distinct number between 0 and m and assigns to each edge \(e=(x,y)\) the absolute difference of the values of x and y. A graph is graceful if it has a numbering in which each edge is assigned a unique value. A helm \(H_ n\), \(n\geq 3\), is the graph obtained from the wheel \(W_ n\) with n spokes, by adding a pendant edge at each vertex on the wheel's rim. This paper proves that helms are graceful.
Recommendations
Cited in
(4)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222239)