Encryption and decryption using decomposition of complete graph \(K_{3(6n+1)}\)

DOI10.47836/mjms.18.2.10MaRDI QIDQ6585470

P. Venugopal, N. Sujaudeen, C. Beaula

Publication date: 9 August 2024

Published in: Malaysian Journal of Mathematical Sciences (Search for Journal in Brave)

zbMATH Keywords

encryptiondecryptiondecomposition of a complete graphanti-magic decomposed labelling

Mathematics Subject Classification ID

Computer science (68-XX) Combinatorics (05-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Modular arithmetic before C. F. Gauss: systematizations and discussions on remainder problems in 18th-century Germany
• Cryptographic hash functions from expander graphs
• Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
• Decomposition of \(K_{m,n}\) into short cycles
• Hash functions and Cayley graphs
• Decomposition of graphs into paths and cycles
• Multidecompositions of several graph products
• On Extremal Graph Theory, Explicit Algebraic Constructions of Extremal Graphs and Corresponding Turing Encryption Machines
• Inner magic and inner antimagic graphs in cryptography
• Decomposition of product graphs into paths and cycles of length four
• Decomposing subcubic graphs into claws, paths or triangles
• Edge Irregular Reflexive Labeling for Some Classes of Plane Graphs

This page was built for publication: Encryption and decryption using decomposition of complete graph \(K_{3(6n+1)}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6585470)