A sum labelling for the generalised friendship graph

Henning Fernau, Joe F. Ryan, Kiki A. Sugeng

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)734-740
Number of pages7
JournalDiscrete Mathematics
Volume308
Issue number5-6
DOIs
Publication statusPublished - 28 Mar 2008

Keywords

  • Flower graphs
  • Friendship graphs
  • Sum labelling

Fingerprint

Dive into the research topics of 'A sum labelling for the generalised friendship graph'. Together they form a unique fingerprint.

Cite this