Llwytho...

On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs

We study an edge irregular reflexive k-labelling for the generalized friendship graphs, also known as flowers (a symmetric collection of cycles meeting at a common vertex), and determine the exact value of the reflexive edge strength for several subfamilies of the generalized friendship graphs.

Wedi'i Gadw mewn:
Manylion Llyfryddiaeth
Prif Awduron: Martin Bača, Muhammad Irfan, Joe Ryan, Andrea Semaničová-Feňovčíková, Dushyant Tanna
Fformat: Artigo
Iaith:Inglês
Cyhoeddwyd: MDPI AG 2017-11-01
Cyfres:Mathematics
Pynciau:
Mynediad Ar-lein:https://www.mdpi.com/2227-7390/5/4/67
Tagiau: Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!