Some Graph-Based Encryption Schemes

In today’s technological world, confidentiality is an important issue to deal with, and it is carried out through different proficiencies. Cryptography is a scientific technique of securing a communication from unauthenticated approach. There exist many encryption algorithms in cryptography for data security. The need of new nonstandard encryption algorithms has been raised to prevent the communication from traditional attacks. This paper proposes some new encryption algorithms for secure transmission of messages using some special corona graphs and bipartite graph along with some algebraic properties. These proposed encryption schemes will lead to more secure communication of secret messages.

Packing chromatic numbers of finite super subdivisions of graphs

Given a graph G and a positive integer i, an i-packing in G is a subset W of the vertex set of G such that the distance between any two distinct vertices from W is greater than i. The packing chromatic number of a graph G, ??(G), is the smallest integer k such that the vertex set of G can be partitioned into sets Vi, i ? {1,..., k}, where each Vi is an i-packing. In this paper, we present some general properties of packing chromatic numbers of finite super subdivisions of graphs. We determine the packing chromatic numbers of the finite super subdivisions of complete graphs, cycles and some neighborhood corona graphs.