A sum labelling for the generalised friendship graph

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

doi:10.1016/j.disc.2007.07.059

A sum labelling for the generalised friendship graph

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

Department of Mathematics

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	734-740
Number of pages	7
Journal	Discrete Mathematics
Volume	308
Issue number	5-6
DOIs	https://doi.org/10.1016/j.disc.2007.07.059
Publication status	Published - 28 Mar 2008

Keywords

Flower graphs
Friendship graphs
Sum labelling

Access to Document

10.1016/j.disc.2007.07.059

Cite this

@article{bdbbaffc7d244192a644459937536d71,

title = "A sum labelling for the generalised friendship graph",

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",

author = "Henning Fernau and Ryan, {Joe F.} and Sugeng, {Kiki A.}",

year = "2008",

month = mar,

day = "28",

doi = "10.1016/j.disc.2007.07.059",

language = "English",

volume = "308",

pages = "734--740",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "5-6",

}

TY - JOUR

T1 - A sum labelling for the generalised friendship graph

AU - Fernau, Henning

AU - Ryan, Joe F.

AU - Sugeng, Kiki A.

PY - 2008/3/28

Y1 - 2008/3/28

N2 - 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.

AB - 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.

KW - Flower graphs

KW - Friendship graphs

KW - Sum labelling

UR - http://www.scopus.com/inward/record.url?scp=38049139114&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2007.07.059

DO - 10.1016/j.disc.2007.07.059

M3 - Article

AN - SCOPUS:38049139114

VL - 308

SP - 734

EP - 740

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 5-6

ER -

A sum labelling for the generalised friendship graph

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this