Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

On the Edge-Graceful \((n, kn)\) -Multigraphs Conjecture

Yong-Song Ho1, Sin-Min Lee2, Eric Seah3
1Department of Mathematics National University of Singapore REPUBLIC OF SINGAPORE
2 Department of Mathematics and Computer Science San Jose State University San Jose, California 95192 U.S.A.
3Department of Actuarial and Management Sciences University of Manitoba Winnipeg, Manitoba RIT 2N2 CANADA
  • Published: 30/04/1991

Abstract

Lee conjectures that for any \(k > 1\), a \((n,nk)\)-multigraph decomposable into \(k\) Hamiltonian cycles is edge-graceful if \(n\) is odd. We investigate the edge-gracefulness of a special class of regular multigraphs and show that the conjecture is true for this class of multigraphs.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Yong-Song Ho, Sin-Min Lee, Eric Seah. On the Edge-Graceful \((n, kn)\) -Multigraphs Conjecture[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 009. 141-147. DOI: .