| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650770 | Discrete Mathematics | 2008 | 7 Pages |
Abstract
We provide an optimal sum labelling scheme for the generalised friendship graph, also known as the flower (a symmetric collection of cycles meeting at a common vertex) and show that its sum number is 2.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Henning Fernau, Joe F. Ryan, Kiki A. Sugeng,