• Tidak ada hasil yang ditemukan

DECOMPOSITIONS OF COMPLETE GRAPHS INTO KAYAK PADDLES | Froncek | Journal of the Indonesian Mathematical Society 17 47 1 PB

N/A
N/A
Protected

Academic year: 2017

Membagikan "DECOMPOSITIONS OF COMPLETE GRAPHS INTO KAYAK PADDLES | Froncek | Journal of the Indonesian Mathematical Society 17 47 1 PB"

Copied!
1
0
0

Teks penuh

(1)

J. Indones. Math. Soc.

Special Edition (2011), pp. 39–44.

DECOMPOSITIONS OF COMPLETE GRAPHS INTO

KAYAK PADDLES

Dalibor Froncek

1

, Leah Tollefson

2

1

Department of Mathematics and Statistics, University of Minnesota

Duluth, 1117 University Drive, Duluth, MN 55812-3000, U.S.A.

2

Department of Mathematics and Statistics, University of Minnesota

Duluth, 1117 University Drive, Duluth, MN 55812-3000, U.S.A.

Abstract. A canoe paddle is a cycle attached to an end-vertex of a path. It was

shown by Truszczy´nski 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 graphK2n+1 is decomposable into kayak paddles withnedges

whenever at least one of its cycles is even.

Key words: Graph decomposition, graceful labeling, rosy labeling.

2000 Mathematics Subject Classification: 05C78.

Referensi

Dokumen terkait

Key words and Phrases : Boussinesq equation, MTA, wave propagation, asymtotic expansion, AAF, extreme position. Marwan : Department of Mathematics, Faculty of Mathematics and

University of Indonesia, Kampus Depok, Depok 15424, Indonesia, [email protected]. 2 Department of Mathematics, Faculty of Mathematics and

Department of Mathematics, Gogte Institute of Technology, Udyambag, Belgaum – 590008, India, [email protected]. Department of Mathematics, Gogte Institute of Technology,

THE GOODNESS OF LONG PATH WITH RESPECT TO MULTIPLE COPIES OF COMPLETE GRAPHS.. I

School of Mathematics and Informatics, Henan Polytechnic University, Jiaozuo City, Henan Province, 454010, China.. E-mail:

Department of Chemistry Faculty of Mathematics and Natural Sciences, Sriwijaya University, Palembang, Indonesia.. 2 Department of Pharmacy, Faculty of Mathematics and

EDGE TRANSITIVE DIHEDRAL COVERS OF THE HEAWOOD GRAPH Mehdi Alaeiyan1, Laleh Pourmokhtar2 1Department of Mathematics, Iran University of Science and Technology, Narmak, Tehran16844,

PERFECT 3-COLORINGS OF GP5,2, GP6,2, AND GP7,2 GRAPHS Mehdi Alaeiyan1, Hamed Karami2, and Sajjad Siasat3 1 School of Mathematics, Iran University of Science and Technology, Narmak,