Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees
From MaRDI portal
Publication:2409751
DOI10.1016/j.akcej.2017.01.004zbMath1372.05193OpenAlexW2588424454MaRDI QIDQ2409751
Publication date: 13 October 2017
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2017.01.004
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two theorems on graceful trees
- All arbitrarily fixed generalized banana trees are graceful
- Trees having an even or quasi even degree sequence are graceful
- The gracefulness of a class of lobster trees
- The subdivision graph of a graceful tree is a graceful tree
- A dynamic survey of graph labeling
- Operations of interlaced trees and graceful trees
- All trees of diameter five are graceful
- Relaxed graceful labellings of trees