The mathematical concepts from graph theory form very useful basis for practical applications in cryptography, in particular, labeled graphs. In this work, certain particular labeled graphs are being considered with algorithms developed for them, and with another option of using existing algorithms like AES, Triple DES with 2 and 3 keys also with these labeled graphs. The algorithms and techniques expressed herein can be used for other labeled graphs also and possibly in other structures of different disciplines as well, resembling these graphs. Additional layers of hiding become possible due to the algorithms based on the labeled graphs.

graph labeling, felicitous, sequential, antimagic, graceful, inner magic, inner antimagic, AES, Triple DES, felicitous adjacency matrix, cipher-matrix, message-matrix, encryption-matrix.