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

Computing The Irregularity Strength of Planar Graphs

Author

Listed:
  • Hong Yang

    (School of Information Science and Engineering, Chengdu University, Chengdu 610106, China)

  • Muhammad Kamran Siddiqui

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

  • Muhammad Ibrahim

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

  • Sarfraz Ahmad

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

  • Ali Ahmad

    (College of Computer Science & Information Systems, Jazan University, Jazan 45142, Saudi Arabia)

Abstract

The field of graph theory plays a vital role in various fields. One of the important areas in graph theory is graph labeling used in many applications such as coding theory, X-ray crystallography, radar, astronomy, circuit design, communication network addressing, and data base management. In this paper, we discuss the totally irregular total k labeling of three planar graphs. If such labeling exists for minimum value of a positive integer k , then this labeling is called totally irregular total k labeling and k is known as the total irregularity strength of a graph G . More preciously, we determine the exact value of the total irregularity strength of three planar graphs.

Suggested Citation

  • Hong Yang & Muhammad Kamran Siddiqui & Muhammad Ibrahim & Sarfraz Ahmad & Ali Ahmad, 2018. "Computing The Irregularity Strength of Planar Graphs," Mathematics, MDPI, vol. 6(9), pages 1-14, August.
    • Handle: RePEc:gam:jmathe:v:6:y:2018:i:9:p:150-:d:166649
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/6/9/150/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/6/9/150/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Muhammad Kamran Siddiqui & Deeba Afzal & Muhammad Ramzan Faisal, 2017. "Total edge irregularity strength of accordion graphs," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 534-544, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiujun Zhang & Muhammad Ibrahim & Syed Ahtsham ul Haq Bokhary & Muhammad Kamran Siddiqui, 2018. "Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs," Mathematics, MDPI, vol. 6(9), pages 1-10, August.

    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:9:p:150-:d:166649. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.