Main Article Content
Abstract
A canoe paddle is a cycle attached to an end-vertex of a path. It was shown by Truszczynski that all canoe paddles are graceful and therefore decompose complete graphs. A kayak paddle is a pair of cycles joined by a path. We prove that the complete graph K<sub>2n+1</sub> is decomposable into kayak paddles with <i>n</i> edges whenever at least one of its cycles is eve.
Keywords
Graph decomposition
graceful labeling
rosy labeling
Article Details
How to Cite
Froncek, D., & Tollefson, L. (2012). DECOMPOSITIONS OF COMPLETE GRAPHS INTO KAYAK PADDLES. Journal of the Indonesian Mathematical Society, 39–44. https://doi.org/10.22342/jims.0.0.17.39-44
