The edge-graceful spectra of connected bicyclic graphs without pendant

W.C. SHIU, Man Ho Alpha LING, Richard M. LOW

Research output: Contribution to journalArticlespeer-review

6 Citations (Scopus)

Abstract

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. Copyright © 2008 Charles Babbage Research Centre.
Original languageEnglish
Pages (from-to)171-185
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
Volume66
Publication statusPublished - 2008

Citation

Shiu, W. C., Ling, M. H., & Low, R. M. (2008). The edge-graceful spectra of connected bicyclic graphs without pendant. Journal of Combinatorial Mathematics and Combinatorial Computing, 66, 171-185.

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