On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs

Martin Bača, Muhammad Irfan, Joe Ryan, Andrea Semaničová-Feňovčíková, Dushyant Tanna
2017 Mathematics  
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.
doi:10.3390/math5040067 fatcat:igspm7keljan5ojm2qem25vhhy