Edge-gracefulness of the composition of paths with null graphs

Wai Chee SHIU*, Peter Che Bor Lam, Hee Lin Cheng

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

12 Citations (Scopus)
22 Downloads (Pure)


Let G = (V,E) be a (p,q)-graph. Let f:E → {1,2,...,9} be a bijection. The induced mapping f+ : V→p of / is defined by f+(M) = σurεE;/(uv) (modp) for i/£ V. If /+ is a bijection, then G is called edge-graceful. In this paper, we investigate the edge-gracefulness of the composition of paths with null graphs Pm o Nn, where there are mn vertices and (m -1 )n2 edges. We show that P) o N is edge-graceful if H is odd.

Original languageEnglish
Pages (from-to)63-76
Number of pages14
JournalDiscrete Mathematics
Issue number1-3
Publication statusPublished - 6 Jun 2002

Scopus Subject Areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

User-Defined Keywords

  • Composition of graph
  • Edge-graceful
  • Labeling matrix


Dive into the research topics of 'Edge-gracefulness of the composition of paths with null graphs'. Together they form a unique fingerprint.

Cite this