Image-Type Labellings/Colorings In Graph Homomorphisms And Graphic Lattices
Bing Yao, Hongyu Wang, Jing Su, Hui Sun · 2020
In topological authentication for encrypting networks wholly we define matchings of dual-type and image-type labellings/colorings, such as totally-dual (Wf, Wg)-type total-image labellings/colorings, uniformly dual-image (Wf, Wg)type labellings/colorings; and moreover we define graph edge-homomorphism from a graph to another graph, graph edge-homomorphism, dual-image graph base-homomorphism, matching of (Wf, Wg)-type number strings. The Number String Decomposition Problem is proposed for resisting possibly the attack of supercomputers and quantum computing.