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

Efficient Graph Network Using Total Magic Labeling and Its Applications

Author

Listed:
  • Annamalai Meenakshi

    (Department of Mathematics, Vel Tech Rangarajan Dr. Sagunthala R & D Institute of Science and Technology, Chennai 600062, India)

  • Adhimoolam Kannan

    (Department of Mathematics, Vel Tech Multi Tech Dr. Rangarajan Dr. Sakunthala Engineering College, Chennai 600062, India)

  • Robert Cep

    (Department of Machining, Assembly and Engineering Metrology, Faculty of Mechanical Engineering, VSB-Technical University of Ostrava, 708 00 Ostrava, Czech Republic)

  • Muniyandy Elangovan

    (Department of Biosciences, Saveetha School of Engineering, Saveetha Nagar, Thandalam 602105, India
    Department of R&D, Bond Marine Consultancy, London EC1V 2NX, UK)

Abstract

Cryptography is a pivotal application of graph theory in ensuring secure communication systems. Modern cryptography is deeply rooted in mathematical theory and computer science practices. It is widely recognized that encryption and decryption processes are primarily outcomes of mathematical research. Given the increasing importance of safeguarding secret information or messages from potential intruders, it is imperative to develop effective technical tools for this purpose. These intruders are often well-versed in the latest technological advancements that could breach security. To address this, our study focuses on the efficacious combinatorial technique of graph networks using efficient domination and total magic labeling. The introduction of a graph network based on total magic labeling can significantly influence the network’s performance. This research introduces a novel combinatorial method for encrypting and decrypting confidential numbers by leveraging an efficient dominant notion and labeled graph.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:19:p:4132-:d:1251217
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/19/4132/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/19/4132/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Henning, Michael A. & Pilśniak, Monika & Tumidajewicz, Elżbieta, 2022. "Bounds on the paired domination number of graphs with minimum degree at least three," Applied Mathematics and Computation, Elsevier, vol. 417(C).
    2. Narayanan Kumaran & Annamalai Meenakshi & Miroslav Mahdal & Jayavelu Udaya Prakash & Radek Guras, 2023. "Application of Fuzzy Network Using Efficient Domination," Mathematics, MDPI, vol. 11(10), pages 1-20, May.
    3. 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.
    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. Annamalai Meenakshi & Adhimoolam Kannan & Miroslav Mahdal & Krishnasamy Karthik & Radek Guras, 2023. "A Comparative Study of Fuzzy Domination and Fuzzy Coloring in an Optimal Approach," Mathematics, MDPI, vol. 11(18), pages 1-16, 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:11:y:2023:i:19:p:4132-:d:1251217. 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.