Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

On Edge-Gracefulness of \(2\)-Regular Graphs

Sin-Min Lee1, Sheng-Ping Lo2, Eric Seah3
1Dept. of Mathematics and Computer Science San Jose State University San Jose, California 95192 U.S.A.
2AT & T, Bell Laboratories Holmdel, New Jersey 07733 U.S.A,
3Dept. of Actuarial and Management Sciences University of Manitoba Winnipeg, Manitoba R3T 2N2 CANADA
  • Published: 31/10/1992

Abstract

We investigate the edge-gracefulness of \(2\)-regular graphs.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Sin-Min Lee, Sheng-Ping Lo, Eric Seah. On Edge-Gracefulness of \(2\)-Regular Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 012. 109-117. DOI: .