DECOMPOSITIONS OF COMPLETE GRAPHS INTO KAYAK PADDLES
| Main Authors: | Froncek, Dalibor; University of Minnesota, Tollefson, Leah; University of Minnesota |
|---|---|
| Format: | Article application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
IndoMS
, 2012
|
| Subjects: | |
| Online Access: |
http://www.jims-a.org/index.php/jimsa/article/view/17 |
Daftar Isi:
- 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