On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs

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.

Bibliographic Details
Main Authors: Martin Bača, Muhammad Irfan, Joe Ryan, Andrea Semaničová-Feňovčíková, Dushyant Tanna
Format: Article
Language:English
Published: MDPI AG 2017-11-01
Series:Mathematics
Subjects:
edge irregular reflexive labelling
reflexive edge strength
cycles
generalized friendship graph
Online Access:https://www.mdpi.com/2227-7390/5/4/67

Internet

https://www.mdpi.com/2227-7390/5/4/67

Similar Items