Generation of graceful trees from arbitrary trees (Q2923325)
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 6356048
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generation of graceful trees from arbitrary trees |
scientific article; zbMATH DE number 6356048 |
Statements
15 October 2014
0 references
graceful graph
0 references
graceful tree conjecture
0 references
Generation of graceful trees from arbitrary trees (English)
0 references
A graph \(G=(V,E)\) is graceful if there is an injection \(g:V\rightarrow \{1,\dots,\left| E\right| \}\) such that the induced edge labeling \( l(e=uv)=\left| g(u)-g(v)\right| \) is a bijection \(E\rightarrow \{1,\dots,\left| E\right| \}.\) The famous graceful tree conjecture, due to Kotzig, Ringel and Rosa, claims that each tree is graceful. In this paper, an algorithm for constructing graceful trees is provided.
0 references
0.8898689150810242
0 references
0.8843249082565308
0 references
0.8790557980537415
0 references
0.874950647354126
0 references
0.8716274499893188
0 references
