posted on 2025-05-09, 13:57authored byMartin Bača, Muhammad Irfan, Joseph RyanJoseph Ryan, Andrea Semaničová-Feňovčíková, Dushyant Tanna
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.