IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v5y2017i4p67-d119718.html
   My bibliography  Save this article

On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs

Author

Listed:
  • 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)

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.

Suggested Citation

  • Martin Bača & Muhammad Irfan & Joe Ryan & Andrea Semaničová-Feňovčíková & Dushyant Tanna, 2017. "On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs," Mathematics, MDPI, vol. 5(4), pages 1-11, November.
  • Handle: RePEc:gam:jmathe:v:5:y:2017:i:4:p:67-:d:119718
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/5/4/67/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/5/4/67/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:5:y:2017:i:4:p:67-:d:119718. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.