The edge-graceful spectra of connected bicyclic graphs without pendant

Wai Chee Shiu*, M. H. Ling, Richard M. Low

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

9 Citations (Scopus)


Let G be a connected simple (p, q)-graph and k a non-negative integer. The graph G is said to be k-edge-graceful if the edges can be labeled with k, k + 1,..., k + q - 1 so that the vertex sums are distinct modulo p. The set of all k where G is k-edge-graceful is called the edge-graceful spectrum of G. In 2004, Lee, Cheng and Wang analyzed the edge-graceful spectra of certain connected bicyclic graphs, leaving some cases as open problems. Here, we determine the edge-graceful spectra of all connected bicyclic graphs without pendant.

Original languageEnglish
Pages (from-to)171-185
Number of pages15
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
Publication statusPublished - Aug 2008

Scopus Subject Areas

  • Mathematics(all)


Dive into the research topics of 'The edge-graceful spectra of connected bicyclic graphs without pendant'. Together they form a unique fingerprint.

Cite this