Portal de Periódicos da CAPES

A sum labelling for the generalised friendship graph

2007; Elsevier BV; Volume: 308; Issue: 5-6 Linguagem: Inglês

10.1016/j.disc.2007.07.059

1872-681X

Henning Fernau, Joe Ryan, Kiki Ariyanti Sugeng,

graph theory and CDMA systems

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.