Loading [MathJax]/jax/output/HTML-CSS/config.js
The key-models and their lock-models for designing new labellings of networks | IEEE Conference Publication | IEEE Xplore

The key-models and their lock-models for designing new labellings of networks


Abstract:

The security of real networks is facing serious challenges and is harder than ever. We propose an idea of “topological structure + number theory” for designing new passwo...Show More

Abstract:

The security of real networks is facing serious challenges and is harder than ever. We propose an idea of “topological structure + number theory” for designing new passwords. By means of graph theory we define a twin odd-graceful tree T = T1 o T2 obtained by identifying a certain vertex of T1 with a certain vertex of T2 together. We prove that some particular trees (key-models) can have their associated trees (lock-models) under the concept of twin odd-graceful trees. Trees having set-ordered odd-graceful labellings T1 with their associated trees T2 can produce certain twin odd-graceful trees such that these twin odd-graceful trees are odd-graceful.
Date of Conference: 03-05 October 2016
Date Added to IEEE Xplore: 02 March 2017
ISBN Information:
Conference Location: Xi'an, China

Contact IEEE to Subscribe

References

References is not available for this document.