Efficient Graph Network Using Total Magic Labeling and Its Applications

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27230%2F23%3A10253250" target="_blank" >RIV/61989100:27230/23:10253250 - isvavai.cz</a>

Result on the web

<a href="https://www.webofscience.com/wos/woscc/full-record/WOS:001094702500001" target="_blank" >https://www.webofscience.com/wos/woscc/full-record/WOS:001094702500001</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3390/math11194132" target="_blank" >10.3390/math11194132</a>

Result language

angličtina

Original language name

Efficient Graph Network Using Total Magic Labeling and Its Applications

Original language description

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&apos;s performance. This research introduces a novel combinatorial method for encrypting and decrypting confidential numbers by leveraging an efficient dominant notion and labeled graph.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

20300 - Mechanical engineering

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2023

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Mathematics

ISSN

2227-7390

e-ISSN

2227-7390

Volume of the periodical

11

Issue of the periodical within the volume

19

Country of publishing house

CH - SWITZERLAND

Number of pages

21

Pages from-to

—

UT code for WoS article

001094702500001

EID of the result in the Scopus database

—