Folding trees gracefully
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 cl...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-09-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.10.001 |