Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

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
  • Published: 31/08/2012

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 \( K_{2nt+1} \) for every positive integer \( t \).

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
K. Brewington, R. C. Bunge, L. J. Cross, S. I. El-Zanati, C. K. Pawlak, J. L. Smith, M. Zeppetello. On Cyclic \(G\)-Designs where \(G\) is the One-Point Union of Two Cycles[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 082. 33-58. DOI: .