On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs

Martin Bača, Muhammad Irfan, Joe Ryan, Andrea Semaničová-Feňovčíková and Dushyant Tanna
Additional contact information
Martin Bača: Department of Applied Mathematics and Informatics, Technical University, 042 00 Košice, Slovakia
Muhammad Irfan: Abdus Salam School of Mathematical Sciences, GC University, 54 000 Lahore, Pakistan
Joe Ryan: School of Electrical Engineering and Computer Science, the University of Newcastle, Callaghan, NSW 2308, Australia
Andrea Semaničová-Feňovčíková: Department of Applied Mathematics and Informatics, Technical University, 042 00 Košice, Slovakia
Dushyant Tanna: School of Mathematical and Physical Sciences, the University of Newcastle, Callaghan, NSW 2308, Australia

Mathematics, 2017, vol. 5, issue 4, 1-11

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.

Keywords: edge irregular reflexive labelling; reflexive edge strength; cycles; generalized friendship graph (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/5/4/67/pdf (application/pdf)
https://www.mdpi.com/2227-7390/5/4/67/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:5:y:2017:i:4:p:67-:d:119718

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().