Abstract
Graphical passwords (GPWs) have been used in the world. Topological graphic passwords (Topsnut-GPWs) differ from the existing graphical passwords and have many virtues in usage of mobile devices with touch screen. In this paper, we design new Hanzi-GPWs based on Hanzi (Chinese characters). We try to transform Chinese characters into mathematical models, called Hanzi-graphs here. We show that a Hanzi-graph $H = \cup _{i = 1}^m{H_i}$ with disjoint Hanzi-graphs H 1 , H 2 , …, H m admitting set-ordered graceful labelling admits an e-labellings. Some problems, at the end of this article, are proposed for further research.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
