No label defined (Q3222239)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3887748
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3887748 |
Statements
1984
0 references
graceful
0 references
helm
0 references
0.8002476096153259
0 references
0.7988761067390442
0 references
[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.
0 references