Contents

On the Edge-graceful Spectra of the Cylinder Graphs (I)

Sin-Min Lee1, Claude Levesque2, Sheng-Ping Bill Lo3, Karl Schaffer4
1Department of Computer Science San Jose State University San Jose, California 95192 U.S.A.
2Département de mathématiques et de statistique Université Laval Québec, QC Canada G1K 7P4
3Cisco Systems, Inc. 170, West Tasman Drive San Jose, CA 95134
4Department of Mathematics De Anza College Cupertino, CA95014

Abstract

Let \( G \) be a \( (p, q) \)-graph and \( k \geq 0 \). A graph \( G \) is said to be k-edge-graceful if the edges can be labeled by \( k, k+1, \dots, k+q-1 \) so that the vertex sums are distinct, modulo \( p \). We denote the set of all \( k \) such that \( G \) is \( k \)-edge graceful by \( \text{egS}(G) \). The set is called the \textbf{edge-graceful spectrum} of \( G \). In this paper, we are concerned with the problem of exhibiting sets of natural numbers which are the edge-graceful spectra of the cylinder \( C_{n} \times P_{m} \), for certain values of \( n \) and \( m \).