(1, N)-Arithmetic Labelling in Multimedia and Network Technology
![](https://ojsdergi.com/ojsicons/gor.png)
![](https://ojsdergi.com/ojsicons/pdf.png)
Keywords:
Graceful, $(1, N)$-Arithmetic, image scramblingAbstract
A graph G is said to be $(1, N)$-Arithmetic (where N is a positive integer) if there is a function f from the vertex set of G to $\{0,1,N,(N + 1),2N,(2N + 1),\dots,N(q-1),N(q-1) + 1\}$ in such a way that (i) f is $1-1$ (ii) f induces a bijection $f^{\ast }$ from the edge set of G to $\{1,N + 1,2N + 1,\dots,N(q-1) + 1\}$ where $f^{\ast }(uv)=|f(u)-f(v)|$. In this paper we investigate the experimental results and point out that the new image scrambling method established on $(1, N)$-Arithmetic labelling of tree can deliver a high level security owing to the strong anomaly of sorting transformation.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 International Journal of Mathematics And its Applications
![Creative Commons License](http://i.creativecommons.org/l/by-nc/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.