Efficient Graph Network Using Total Magic Labeling and Its Applications

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Efficient Graph Network Using Total Magic Labeling and Its Applications

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Efficient Graph Network Using Total Magic Labeling and Its Applications

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

20300 - Mechanical engineering

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2023

Kód důvěrnosti údajů

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

Název periodika

Mathematics

ISSN

2227-7390

e-ISSN

2227-7390

Svazek periodika

11

Číslo periodika v rámci svazku

19

Stát vydavatele periodika

CH - Švýcarská konfederace

Počet stran výsledku

21

Strana od-do

—

Kód UT WoS článku

001094702500001

EID výsledku v databázi Scopus

—