Next Article in Journal
Channel Engineering for Nanotransistors in a Semiempirical Quantum Transport Model
Previous Article in Journal
Picard’s Iterative Method for Caputo Fractional Differential Equations with Numerical Results
Open AccessArticle

On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs

1
Department of Applied Mathematics and Informatics, Technical University, 042 00 Košice, Slovakia
2
Abdus Salam School of Mathematical Sciences, GC University, 54 000 Lahore, Pakistan
3
School of Electrical Engineering and Computer Science, the University of Newcastle, Callaghan, NSW 2308, Australia
4
School of Mathematical and Physical Sciences, the University of Newcastle, Callaghan, NSW 2308, Australia
*
Author to whom correspondence should be addressed.
Academic Editor: Yang-Hui He
Mathematics 2017, 5(4), 67; https://doi.org/10.3390/math5040067
Received: 22 June 2017 / Revised: 6 October 2017 / Accepted: 15 November 2017 / Published: 21 November 2017
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. View Full-Text
Keywords: edge irregular reflexive labelling; reflexive edge strength; cycles; generalized friendship graph edge irregular reflexive labelling; reflexive edge strength; cycles; generalized friendship graph
Show Figures

Figure 1

MDPI and ACS Style

Bača, M.; Irfan, M.; Ryan, J.; Semaničová-Feňovčíková, A.; Tanna, D. On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs. Mathematics 2017, 5, 67.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop