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

Refbacks

  • There are currently no refbacks.


Journal of the Indonesian Mathematical Society ( p-ISSN:2086-8952 | e-ISSN:2460-0245) published by the Indonesian Mathematical Society (IndoMS).

Indexed by:

logo DOAJLogo SintaThe Indonesian Publication Index-Portal Garuda Google Scholar logo zbMath Logo AMSLogo CrossrefLogo Thomson Reuters

Visitor Number : web statistics View My Stats


Creative Commons License
Journal of the Indonesian Mathematical Society by http://jims-a.org/index.php/jimsa is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

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