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

Edge Irregular Reflexive Labeling for Disjoint Union of Generalized Petersen Graph

Author

Listed:
  • Juan L. G. Guirao

    (Departamento de Matemática Aplicada y Estadística, Universidad Politécnica de Cartagena, Hospital de Marina, 30203 Cartagena, Región de Murcia, Spain)

  • Sarfraz Ahmad

    (Department of Mathematics, COMSATS University Islamabad, Lahore Campus, Lahore 54000, Pakistan)

  • Muhammad Kamran Siddiqui

    (Department of Mathematics, COMSATS University Islamabad, Sahiwal Campus, Sahiwal 57000, Pakistan)

  • Muhammad Ibrahim

    (Centre for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University Multan, Multan 60800, Pakistan)

Abstract

A graph labeling is the task of integers, generally spoken to by whole numbers, to the edges or vertices, or both of a graph. Formally, given a graph G = ( V , E ) a vertex labeling is a capacity from V to an arrangement of integers. A graph with such a capacity characterized is known as a vertex-labeled graph. Similarly, an edge labeling is an element of E to an arrangement of labels. For this situation, the graph is called an edge-labeled graph. We examine an edge irregular reflexive k -labeling for the disjoint association of the cycle related graphs and decide the correct estimation of the reflexive edge strength for the disjoint association of s isomorphic duplicates of the cycle related graphs to be specific Generalized Peterson graphs.

Suggested Citation

  • Juan L. G. Guirao & Sarfraz Ahmad & Muhammad Kamran Siddiqui & Muhammad Ibrahim, 2018. "Edge Irregular Reflexive Labeling for Disjoint Union of Generalized Petersen Graph," Mathematics, MDPI, vol. 6(12), pages 1-10, December.
  • Handle: RePEc:gam:jmathe:v:6:y:2018:i:12:p:304-:d:188105
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/6/12/304/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/6/12/304/
    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:6:y:2018:i:12:p:304-:d:188105. 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.