DECOMPOSITIONS OF COMPLETE GRAPHS INTO KAYAK PADDLES

Dalibor Froncek, Leah Tollefson

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.

DOI : http://dx.doi.org/10.22342/jims.0.0.17.39-44


Keywords


Graph decomposition, graceful labeling, rosy labeling

Full Text:

ABSTRACT FULL PAPER


DOI: https://doi.org/10.22342/jims.0.0.17.39-44

Refbacks

  • There are currently no refbacks.



Journal of the Indonesian Mathematical Society
Mathematics Department, Universitas Gadjah Mada
Senolowo, Sinduadi, Mlati, Sleman Regency, Special Region of Yogyakarta 55281, Telp. (0274) 552243
Email: jims.indoms@gmail.com


p-ISSN: 2086-8952 | e-ISSN: 2460-0245


Journal of the Indonesian Mathematical Society is licensed under a Creative Commons Attribution 4.0 International License

web statistics
View My Stats