Contents

-

On Cyclic G-Designs where G is the One-Point Union of Two Cycles

K. Brewington1, R. C. Bunge2, L. J. Cross2, S. I. El-Zanati2, C. K. Pawlak2, J. L. Smith1, M. Zeppetello2
1Department of Mathematics, Computer Science & Physics Morehead State University Morehead, KY 40351
2Department of Mathematics Illinois State University Normal, IL 61790-4520 Dedicated in honor of Roger B. Eggleton

Abstract

Let G be the one-point union of two cycles and suppose G has n edges. We show via various graph labelings that there exists a cyclic G-decomposition of K2nt+1 for every positive integer t.