A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs
2017
Mathematics
Preserved Fulltext
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