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

Graph Colorings and Labelings Having Multiple Restrictive Conditions in Topological Coding

Author

Listed:
  • Xiaohui Zhang

    (School of Computer, Qinghai Normal University, Xining 810001, China
    These authors contributed equally to this work.)

  • Chengfu Ye

    (School of Mathmatics and Statistics, Qinghai Normal University, Xining 810001, China
    Academy of Plateau Science and Sustainability, People’s Government of Qinghai Province, Beijing Normal University, Beijing 100875, China
    These authors contributed equally to this work.)

  • Shumin Zhang

    (School of Mathmatics and Statistics, Qinghai Normal University, Xining 810001, China
    Academy of Plateau Science and Sustainability, People’s Government of Qinghai Province, Beijing Normal University, Beijing 100875, China
    These authors contributed equally to this work.)

  • Bing Yao

    (College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China
    These authors contributed equally to this work.)

Abstract

With the fast development of networks, one has to focus on the security of information running in real networks. A technology that might be able to resist attacks equipped with AI techniques and quantum computers is the so-called topological graphic password of topological coding. In order to further study topological coding, we use the multiple constraints of graph colorings and labelings to propose 6C-labeling, 6C-complementary labeling, and its reciprocal-inverse labeling, since they can be applied to build up topological coding. We show some connections between 6C-labeling and other graph labelings/colorings and show graphs admitting twin-type 6C-labelings, as well as the construction of graphs admitting twin-type 6C-labelings.

Suggested Citation

  • Xiaohui Zhang & Chengfu Ye & Shumin Zhang & Bing Yao, 2022. "Graph Colorings and Labelings Having Multiple Restrictive Conditions in Topological Coding," Mathematics, MDPI, vol. 10(9), pages 1-9, May.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:9:p:1592-:d:810779
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Annamalai Meenakshi & Adhimoolam Kannan & Robert Cep & Muniyandy Elangovan, 2023. "Efficient Graph Network Using Total Magic Labeling and Its Applications," Mathematics, MDPI, vol. 11(19), pages 1-21, September.

    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:10:y:2022:i:9:p:1592-:d:810779. 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.