New classes of graceful trees (Q2018958): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2014/194759 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2096765277 / rank | |||
Normal rank | |||
Revision as of 22:32, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New classes of graceful trees |
scientific article |
Statements
New classes of graceful trees (English)
0 references
26 March 2015
0 references
Summary: Graceful labeling is one of the most researched problems. One of the earliest results is that caterpillars are graceful. We show that caterpillars connected to a vertex recursively satisfying certain conditions are also graceful.
0 references
Graceful labeling
0 references
caterpillars
0 references
