A Coding Algorithm using Super-edge Magic Total Labeling of Extended Duplicate Graphs

Graph labeling has wide applications in the field of radio astronomy, computer networks, communication networks and cryptography etc. Encoding is a technique of sending messages as codes over a communication channel decoding is a method of interpreting the received codes into messages again so that...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2022 Second International Conference on Computer Science, Engineering and Applications (ICCSEA) s. 1 - 6
Hlavní autoři: Jegan, R., Vijayakumar, P., Thirusangu, K.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 08.09.2022
Témata:
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Graph labeling has wide applications in the field of radio astronomy, computer networks, communication networks and cryptography etc. Encoding is a technique of sending messages as codes over a communication channel decoding is a method of interpreting the received codes into messages again so that only sender and receiver understands the message and others could not. Graph labeling is an assignment of labels (numbers) to vertices or edges or both subject to certain criteria. In this paper, encoding and decoding algorithms sandwiching super-edge magic total labeling algorithms, super-edge antimagic total labeling and algorithms like affine-cipher and RSA algorithms are presented to encode messages and decode codes and illustrate them with examples.
DOI:10.1109/ICCSEA54677.2022.9936251