Especial Total Colorings Towards Multiple Authentications In Network Encryption

Topological graphic coding (Topsnut-gpws) is a new type of graphical passwords, however it differs from the existing graphical passwords. Topsnut-gpws were contained by the topological coding, a mixture subbranch of graph theory and cryptography. For enriching technique of making Topsnut-gpws, we will design especial proper vertex colorings and proper total colorings by means of the traditional graph proper vertex/total colorings and graph labellings, and estimate the bounds of extremum values for some topological structures based on these colorings, finally, discuss especial sets obtained by these colorings and use these especial sets to generate multiple authentications for serving encrypting networks wholly. Some problems are distributed for further researching the topological coding.