Encryption through labeled graphs using strong face bimagic labeling

Ahmed, Mohammed; Babujee, J. Baskar

doi:10.12988/imf.2017.612167

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2018

2024

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The concepts of F-FMML of the P n graph, butterfly graph, and duplication of graphs were investigated in [11,12]. The encryption of strong-face bimagic labeling has been authenticated in [13].…”

Section: Introductionmentioning

confidence: 99%

Face Bimagic Mean Labeling of Herschel Graphs and Its Operations

Vani Shree,

Dhanalakshmi

2024

Contemp. Math.

View full text Add to dashboard Cite

A bijection ϕ: V(G)→{1,2, . . . , |V(G)|} is called a (1,0,0)-F-face bimagic mean labeling (FBMML) of G if the induced face labeling ϕ*(fi) = = = k1 or k2, constant. This work investigates the possibility of face bimagic mean labeling of a Herschel graph. Also, a study of face bimagic mean labeling during the process of fusion of vertices of degree 3 of a Herschel graph and the duplication of vertices by the edge of a Herschel graph is provided in this research paper.

show abstract

Section: Introductionmentioning

confidence: 99%

Face Bimagic Mean Labeling of Herschel Graphs and Its Operations

Vani Shree,

Dhanalakshmi

2024

Contemp. Math.

View full text Add to dashboard Cite

show abstract

Encrypting Numbers through Square Grid Graphs

Shobana¹

2018

IJET

View full text Add to dashboard Cite

Cryptography emphasizes the mathematics behind the theory of public key cryptosystems and digital signature schemes. Encryption is essential for ensured and trusted delivery of sensitive information whereas the decryption is the process of decoding the data which has been encrypted in to a secret format. An authorized user can only decrypt data since decryption requires a secret key or password. There are several methods to encrypt the numbers. In this paper, a combinatorial technique to encrypt and decrypt numbers through labeled strong face of a square grid graph using residue class of Z3 has been investigated.

show abstract

Encryption through labeled graphs using strong face bimagic labeling

Cited by 2 publications

References 2 publications

Face Bimagic Mean Labeling of Herschel Graphs and Its Operations

Face Bimagic Mean Labeling of Herschel Graphs and Its Operations

Encrypting Numbers through Square Grid Graphs

Contact Info

Product

Resources

About