CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Vol 1, No 1 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS

Super (a; d)-H-Antimagic Total Covering of Triangular Cycle Ladder Graph for Developing Ciphertext

Irma Azizah (Unknown)
Dafik Dafik (Unknown)
Slamin Slamin (Unknown)



Article Info

Publish Date
02 Jun 2020

Abstract

A (a; d)-H-antimagic total covering is a total labeling dari V (G) [ E(G) to integer number f1; 2; 3; :::; jV (G) [ E(G)jg with condition, every subgraph A inP P PG isomorphic with subgraph H A = v2V (A) (v) + e2E(A) (e) on arith-metic sequence. A graph containing the labeling called super (a; d)-H-antimagic total covering. Furthermore , f (v)gv2V = f1; :::; jV jg, is called graph super H antimagic. In this research used triangular Cycle Ladder Graph T CLn of con-nective to developing ciphertext. Key Word : Super H antimagic total selimut, Triangular Cycle Ladder Graph T CLn, Ciphertexts.

Copyrights © 2020






Journal Info

Abbrev

cgant

Publisher

Subject

Computer Science & IT Other

Description

Subjects suitable for publication include, the following fields of: Degree Diameter Problem in Graph Theory Large Graphs in Computer Science Mathematical Computation of Graph Theory Graph Coloring in Atomic and Molecular Graph Labeling in Coding Theory and Cryptography Dimensions of graphs on ...