Cryptanalysis Using Laplace Transform of Error Function
jnanabha
This paper presents a new cryptographic scheme for encryption and decryption by introducing the L... more This paper presents a new cryptographic scheme for encryption and decryption by introducing the Laplace transform of error function. Here we have used the concept of congruence relation and modular arithmetic to nd symmetric key, cipher text and Decryption process. The implementation has been done using Matlab.
The sum cordial labeling is a variant of cordial labeling. In this paper, we investigate 3-Total ... more The sum cordial labeling is a variant of cordial labeling. In this paper, we investigate 3-Total Super Sum Cordial labeling. This labeling is discussed by applying union operation on some of the graphs. A vertex labeling is assigned as a whole number within the range. For each edge of the graph, assign the label, according to some definite rule, defined for the investigated labeling. Any graph which satisfies 3-Total Super Sum Cordial labeling is known as the 3-Total Super Sum Cordial graphs. Here, we prove that some of the graphs like the union of Cycle and Path graphs, the union of Cycle and Complete Bipartite graph and the union of Path and Complete Bipartite graph satisfy the investigated labeling and hence are called the 3-Total Super Sum Cordial graphs.
In this paper, we have discussed a variant of edge sum cordial labeling of graphs known as 3-Tota... more In this paper, we have discussed a variant of edge sum cordial labeling of graphs known as 3-Total edge sum cordial labeling of Graphs. Unlike in 3-Total sum cordial labeling the roles of vertices and edges are interchanged. In this paper, this labeling is investigated by applying union operation onPath and k1,n graphs. MSC: 05C76, 05C78.
International Journal of Computer Applications, 2015
The sum cordial labeling is a variant of cordial labeling. Here a variant of 3-total sum cordial ... more The sum cordial labeling is a variant of cordial labeling. Here a variant of 3-total sum cordial labeling was introduced and name it as 3-total edge sum cordial labeling unlike in 3-total sum cordial labeling the roles of vertices and edges are interchanged. Here in this paper path graph, cycle graph and complete bipartite graph k 1 , n are investigated on this newly defined concept.
International Journal of Applied Information Systems, 2015
In this paper we investigate 3-total super sum cordial labeling for union of some graphs. Suppose... more In this paper we investigate 3-total super sum cordial labeling for union of some graphs. Suppose be a graph with vertex set and edge set. A vertex labeling. For each edge assign the label. The map is called a 3-total super sum cordial labeling if for where denotes the total number of vertices and edges labeled with and for each edge. Any graph which satisfies 3-total super sum cordial labeling is called 3-total super sum cordial graphs. Here we prove some graphs like are 3-total super sum cordial graphs.
Uploads
Papers by Rinku Verma