Twin Odd-graceful Trees Towards Information Security

We design cryptographical graphs for information security by the following principles: (1) be used conveniently in usually; (2) with strong security, that is, it is difficult to be broken; (3) there are enough graphs and labellings for making desired keys and locks. For answering the above problems, we prove the series cryptographical graphs have good properties, and show the guarantee for constructing large scale of cryptographical trees from smaller cryptographical trees. The methods used for constructing the desired cryptographical graphs can be transformed into efficient algorithms.