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.
Author supplied keywords
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Bača, M., Irfan, M., Ryan, J., Semaničová-Feňovčíková, A., & Tanna, D. (2017). On edge irregular reflexive labellings for the generalized friendship graphs. Mathematics, 5(4). https://doi.org/10.3390/math5040067
Readers over time
Readers' Seniority
Readers' Discipline
