Graph Module-<tex>$k$</tex> Odd-elegant Labelling Towards Topological Graphical Passwords

Abstract

Passwords are still dominated by simple structure, and there is a significant increase of using only numbers as passwords. the progress of password security over the previous decade, which shows that most passwords could be easily guessed or cracked. Here we attempt to using a new type of graphical passwords (Topsnut-GPWs) has been designed by technique of graph theory, called module-k odd-elegant labelling. We show examples for testing our methods which can be easily find some network models that admit our new labelling and transformed into effective algorithms.