On Topological Graphic Passwords Made By Hanzi-graphs

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.