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.
2 January 2020 in AKCE International Journal of Graphs and Combinatorics