On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs
Mathematics2017Vol. 5(4), pp. 67–67
Citations Over Time
Abstract
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.