Revision Date



A graceful labeling of a bipartite graph is an \a-labeling if it has the property that the labels assigned to the vertices of one stable set of the graph are smaller than the labels assigned to the vertices of the other stable set. A concatenation of cycles is a connected graph formed by a collection of cycles, where each cycle shares at most either two vertices or two edges with other cycles in the collection. In this work we investigate the existence of \a-labelings for this kind of graphs, exploring the concepts of vertex amalgamation to produce a family of Eulerian graphs, and edge amalgamation to generate a family of outerplanar graphs. In addition, we determine the number of graphs obtained with $k$ copies of the cycle $C_n$, for both types of amalgamations.

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

Amalgamations-2.pdf (283 kB)
Revised version

To TAG editor.pdf (57 kB)
Letter to the editor

ref_tag2022090211.pdf (112 kB)
Supplemental Reference List with DOIs