Title of article
A sum labelling for the generalised friendship graph Original Research Article
Author/Authors
Henning Fernau، نويسنده , , Joe F. Ryan، نويسنده , , Kiki A. Sugeng، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
7
From page
734
To page
740
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
Flower graphs , Friendship graphs , Sum labelling
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947455
Link To Document