Radio Contra Harmonic Mean Graphs in Security Communication
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
Graph theory is a vast field of NP-hard problems, where radio labeling techniques can be versatile for cryptography. Random number generators generate long sequences of numbers that serve as keys for cryptography systems. Every number has an equal probability of being generated; hence these generators follow a consistent distribution that hackers can easily extract. It is possible to produce these keys more quickly and efficiently by using graph labeling algorithms. The labeling type used in this study is called radio contra harmonic mean labeling and the cipher graph is a radio contra harmonic mean graph. The encoded content is sent to the recipient as the cipher graph’s vertex or edge sequence, which is difficult for an attacker to decipher because the labeling method is a hard task.
Fields of Study & Subjects
Graph Labeling and Dimension Problems
Coding theory and cryptography
Smarandache Functions and Recreational Number Theory
Publication details
- Journal / source
- CRC Press eBooks
- Pages
- 364–367
- Publication date
- 31 March 2026
- Language
- EN
- Document type
- Book chapter