J. Arthy

Bio: J. Arthy is an academic researcher. The author has an hindex of 1, co-authored 1 publications receiving 5 citations.

A Method of Secret Coding technique on Two Star Graphs

Abstract: Super Mean Labeling is one the interesting topic in graph theory. There also are search that has proved that the super mean labeling is not possible forth the star graphs. In this paper, we generalized the concept of super mean labeling on two star graphs and develop a technique of coding a secret messages using two star graph through super mean labeling. Two types of coding, picture and matrix coding have been illustrated by using different types of numbering of alphabets and algorithm is established. General Terms Coding Method, Matrix coding, Algorithms

Existence and Non-Existence of Super Mean Labeling on Star Graphs

Abstract: Graph theory is one of the mathematical growing areas to simplify the solution of a problem in day today life. Graph theory can be used to modeling a problem that can be easier to see and find the solution for the problem. The graph consisting of nodes called as vertices connected by links called as edges. In the communication networks, the system (graph) is responsible for carrying the messages through the network and directing them along the right path. One of the important areas in Graph theory is Graph labeling for more results on graph labeling can be found in (Gallian, 2010). The field of graph theory plays vital role in various fields. Graph labeling is an assignment of integers to the vertices or edges or both subject to certain conditions and it is used in many applications like coding theory, x-ray crystallography, radar, astronomy, circuit design and communication network. We developed coding techniques for sharing secrecy through Graph labeling in many research article but here we developed the existence and nonexistence of one Graph labeling. By a graph we mean a finite, simple and undirected one. The vertex set and the edge set of a graph G denoted by p and q respectively. The disjoint union of two graphs G1 and G2 is the graph G1G2 with and E(G1G2) = E(G1)E(G2). The disjoint union of two star K1,m and K1,n is denoted by K1,mK1,n. The wedge of two star is obtained by an edge joining two first copy and second copy of two star for all ui and vj such that ( ) ( ) 1 2 2. 2 i j f u f v m     A Graph Labeling (GL) is an

A method of sharing secrecy using star graphs

Abstract: This article introduces a new technique of picture coding method for a secret text messages in the form of matrix using star related graphs by applying the subset of super mean labeling, sub super mean labeling is one of the important topics in graph theory. Let G be a (p, q) graph and α : V (G) → {1, 2, 3, · · ·, p+q} be an injection. For each edge l = uv, let α*(e)={α(u)+α(v)2ifα(u)+α(v)iseven;α(u)+α(v)+onetwoifα(u)+α(v)isodd then α is called Sub Super Mean Labeling if α(V) U {α*(l) : l G E(G)} C {one, two, three, · · ·, p+q}. A graph that admits a Sub Super Mean Labeling is called a Sub Super Mean Graph.