Folding trees gracefully
Christian Barrientos, Sarah Minion
AKCE International Journal of Graphs and Combinatorics · 2020
doi:10.1016/j.akcej.2019.10.001 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
When a graceful labeling of a bipartite graph assigns the smaller labels to the vertices of one of the stable sets of the graph, the assignment is called an α-labeling. Any graph that admits such a labeling is an α-graph. In this work we extend the concept of vertex amalgamation to generate a new class of α-graphs obtained by a sequence of k-vertex amalgamations of t copies of an α-tree. This procedure is also applied to any collection of α-trees such that any pair of trees in this collection have stable sets with the same cardinalities. We also use this idea on other types of α-graphs. In addition, we present a family of α-trees of even diameter formed with four caterpillars of the same size.
Abstract licence: CC BY-NC
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.