Please use this identifier to cite or link to this item:
Title: On felicitous graphs
Authors: Lee, S.-M.
Schmeichel, E.
Shee, S.C. 
Issue Date: 25-Nov-1991
Citation: Lee, S.-M.,Schmeichel, E.,Shee, S.C. (1991-11-25). On felicitous graphs. Discrete Mathematics 93 (2-3) : 201-209. ScholarBank@NUS Repository.
Abstract: A graph with n edges is called harmonious if it is possible to label the vertices with distinct numbers (modulo n) in such a way that the edge labels which are sums ofend-vertex labels are also distinct (modulo n). A generalization of harmonious graphs is felicitous graphs. In felicitous labelling distinct numbers (modulo n + 1) are used to label the vertices of a graph with n edges so that the edge labels are distinct (modulo n). We give some necessary conditions for a graph to be felicitous. Some families of graphs (cycles of order 4k, complete bipartite graphs, generalized Petersen graphs,...) are shown to be felicitous, while others (cycles of order 4k + 2, the complete graph Kitn when n≥5...) arenot. We also find that almost all graphs are not felicitous. © 1991.
Source Title: Discrete Mathematics
ISSN: 0012365X
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Mar 30, 2023

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.