Encoding and Decoding Algorithm for Ladder Graph on Root Square Mean Labeling
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
A Root Square Mean Labeling (RSML) refers to a graph G with p vertices and q edges. If there exists an injective function ρ : V → {123,…, q + 1} in such a way that each edge e = ab is labeled with https://www.w3.org/1998/Math/MathML" display="inline"> ρ = ρ ( a ) 2 + ρ ( b ) 2 2 or https://www.w3.org/1998/Math/MathML" display="inline"> ρ ( a ) 2 + ρ ( b ) 2 2 then the edge labels are distinct. In this paper we prove that types of ladder graphs. The use of digital data interchange is increasing in all fields in the modern day. Data security is extremely significant when it comes to maintaining and providing data. Labeling plays an essential role in the cryptosystem. In this study, we construct a revised Graph Message Jumble code ( GMJ ) with RSML on a Ladder graph, which is an innovative technique to encoding and decoding. A new algorithm is given for encoding and decoding of secured message.
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
- 374–378
- Publication date
- 31 March 2026
- Language
- EN
- Document type
- Book chapter