A Method of Secret Coding technique on Two Star Graphs
Reads0
Chats0
TLDR
This paper generalized the concept of supermean labeling on two star graphs and develops a technique of coding a secret messages using two star graph through super mean labeling.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, Algorithmsread more
Citations
More filters
Journal ArticleDOI
Existence and Non-Existence of Super Mean Labeling on Star Graphs
TL;DR: This paper developed the existence and nonexistence of one Graph labeling, 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.
Journal ArticleDOI
A method of sharing secrecy using star graphs
TL;DR: 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 supermean labeling is one of the important topics in graph theory.
References
More filters
Journal ArticleDOI
Some asymptotic properties of duplication graphs.
TL;DR: It is conjectured that duplication-dominated, scale-free networks may contain identifiable remnants of their early structure, inherited from the idealized model of pure duplication growth, for which the exact finite-size degree distribution is found and its asymptotic properties studied.
Journal ArticleDOI
Duplication of directed graphs and exponential blow up of proofs
TL;DR: The purpose is to determine geometrical conditions on the graphs of proofs to explain the expansion of the size of proofs after cut elimination and to develop a theory of duplication for directed graphs and derive results on graphs of proof as corollaries.
Book ChapterDOI
Coding Through a Two Star and Super Mean Labeling
TL;DR: In this article, a technique of coding a message is presented using the super mean labeling on a two-star graph K1,m ∪ K 1,n, m ≤ n.
Journal ArticleDOI
On the construction of new classes of super mean graphs
R. Vasuki,A. Nagarajan +1 more
TL;DR: In this article, the construction of two kinds of super mean graphs is discussed and it is shown that any union of any number of super-mean graphs is a super mean graph.